H-Termination proof of /home/matraf/haskell/eval_FullyBlown

MAYBE 123.533 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could not be shown:

↳ HASKELL

  ↳ IFR

mainModule Main

((enumFromThen :: Char -> Char -> [Char]) :: Char -> Char -> [Char])

module Main where

import qualified Prelude

If Reductions:
The following If expression

if d < c then minBound else maxBound

is transformed to

lastChar0 True = minBound

lastChar0 False = maxBound

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

mainModule Main

((enumFromThen :: Char -> Char -> [Char]) :: Char -> Char -> [Char])

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

mainModule Main

((enumFromThen :: Char -> Char -> [Char]) :: Char -> Char -> [Char])

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

p

| n' >= n

= flip (<=) m

| otherwise

= flip (>=) m

is transformed to

p = p2

p0 True = flip (>=) m

p1 True = flip (<=) m

p1 False = p0 otherwise

p2 = p1 (n' >= n)

The following Function with conditions

takeWhile p [] = []

takeWhile p (x : xs)

| p x

= x : takeWhile p xs

| otherwise

= []

is transformed to

takeWhile p [] = takeWhile3 p []

takeWhile p (x : xs) = takeWhile2 p (x : xs)

takeWhile0 p x xs True = []

takeWhile1 p x xs True = x : takeWhile p xs

takeWhile1 p x xs False = takeWhile0 p x xs otherwise

takeWhile2 p (x : xs) = takeWhile1 p x xs (p x)

takeWhile3 p [] = []

takeWhile3 vz wu = takeWhile2 vz wu

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

mainModule Main

((enumFromThen :: Char -> Char -> [Char]) :: Char -> Char -> [Char])

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

takeWhile p (numericEnumFromThen n n')

where

p = p2

p0 True = flip (>=) m

p1 True = flip (<=) m

p1 False = p0 otherwise

p2 = p1 (n' >= n)

are unpacked to the following functions on top level

numericEnumFromThenToP1 wv ww wx True = flip (<=) wv

numericEnumFromThenToP1 wv ww wx False = numericEnumFromThenToP0 wv ww wx otherwise

numericEnumFromThenToP wv ww wx = numericEnumFromThenToP2 wv ww wx

numericEnumFromThenToP2 wv ww wx = numericEnumFromThenToP1 wv ww wx (ww >= wx)

numericEnumFromThenToP0 wv ww wx True = flip (>=) wv

The bindings of the following Let/Where expression

map toEnum (enumFromThenTo (fromEnum c) (fromEnum d) (fromEnum lastChar))

where

lastChar = lastChar0 (d < c)

lastChar0 True = minBound

lastChar0 False = maxBound

are unpacked to the following functions on top level

enumFromThenLastChar0 wy wz True = minBound

enumFromThenLastChar0 wy wz False = maxBound

enumFromThenLastChar wy wz = enumFromThenLastChar0 wy wz (wy < wz)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

mainModule Main

((enumFromThen :: Char -> Char -> [Char]) :: Char -> Char -> [Char])

module Main where

import qualified Prelude

Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                      ↳ Narrow

mainModule Main

(enumFromThen :: Char -> Char -> [Char])

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="enumFromThen",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="enumFromThen xu3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="enumFromThen xu3 xu4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="map toEnum (enumFromThenTo (fromEnum xu3) (fromEnum xu4) (fromEnum (enumFromThenLastChar xu4 xu3)))",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="map toEnum (numericEnumFromThenTo (fromEnum xu3) (fromEnum xu4) (fromEnum (enumFromThenLastChar xu4 xu3)))",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="map toEnum (takeWhile (numericEnumFromThenToP (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3)) (numericEnumFromThen (fromEnum xu3) (fromEnum xu4)))",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="map toEnum (takeWhile (numericEnumFromThenToP (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3)) (iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="map toEnum (takeWhile (numericEnumFromThenToP (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3)) (fromEnum xu3 : iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)))",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3];
10[label="map toEnum (takeWhile2 (numericEnumFromThenToP (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3)) (fromEnum xu3 : iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)))",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3];
11[label="map toEnum (takeWhile1 (numericEnumFromThenToP (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3)) (fromEnum xu3) (iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
12[label="map toEnum (takeWhile1 (numericEnumFromThenToP2 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3)) (fromEnum xu3) (iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP2 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3];
13[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (fromEnum xu4 >= fromEnum xu3)) (fromEnum xu3) (iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (fromEnum xu4 >= fromEnum xu3) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];13 -> 14[label="",style="solid", color="black", weight=3];
14[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (compare (fromEnum xu4) (fromEnum xu3) /= LT)) (fromEnum xu3) (iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (compare (fromEnum xu4) (fromEnum xu3) /= LT) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];14 -> 15[label="",style="solid", color="black", weight=3];
15[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (not (compare (fromEnum xu4) (fromEnum xu3) == LT))) (fromEnum xu3) (iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (not (compare (fromEnum xu4) (fromEnum xu3) == LT)) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];15 -> 16[label="",style="solid", color="black", weight=3];
16[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (not (primCmpInt (fromEnum xu4) (fromEnum xu3) == LT))) (fromEnum xu3) (iterate (fromEnum xu4 - fromEnum xu3 +) (fromEnum xu4 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (fromEnum xu4) (fromEnum xu3) (not (primCmpInt (fromEnum xu4) (fromEnum xu3) == LT)) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];16 -> 17[label="",style="solid", color="black", weight=3];
17[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (primCharToInt xu4) (fromEnum xu3) (not (primCmpInt (primCharToInt xu4) (fromEnum xu3) == LT))) (fromEnum xu3) (iterate (primCharToInt xu4 - fromEnum xu3 +) (primCharToInt xu4 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar xu4 xu3)) (primCharToInt xu4) (fromEnum xu3) (not (primCmpInt (primCharToInt xu4) (fromEnum xu3) == LT)) (fromEnum xu3)))",fontsize=16,color="burlywood",shape="box"];14791[label="xu4/Char xu40",fontsize=10,color="white",style="solid",shape="box"];17 -> 14791[label="",style="solid", color="burlywood", weight=9];
14791 -> 18[label="",style="solid", color="burlywood", weight=3];
18[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char xu40) xu3)) (primCharToInt (Char xu40)) (fromEnum xu3) (not (primCmpInt (primCharToInt (Char xu40)) (fromEnum xu3) == LT))) (fromEnum xu3) (iterate (primCharToInt (Char xu40) - fromEnum xu3 +) (primCharToInt (Char xu40) - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char xu40) xu3)) (primCharToInt (Char xu40)) (fromEnum xu3) (not (primCmpInt (primCharToInt (Char xu40)) (fromEnum xu3) == LT)) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];18 -> 19[label="",style="solid", color="black", weight=3];
19[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char xu40) xu3)) (Pos xu40) (fromEnum xu3) (not (primCmpInt (Pos xu40) (fromEnum xu3) == LT))) (fromEnum xu3) (iterate (Pos xu40 - fromEnum xu3 +) (Pos xu40 - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char xu40) xu3)) (Pos xu40) (fromEnum xu3) (not (primCmpInt (Pos xu40) (fromEnum xu3) == LT)) (fromEnum xu3)))",fontsize=16,color="burlywood",shape="box"];14792[label="xu40/Succ xu400",fontsize=10,color="white",style="solid",shape="box"];19 -> 14792[label="",style="solid", color="burlywood", weight=9];
14792 -> 20[label="",style="solid", color="burlywood", weight=3];
14793[label="xu40/Zero",fontsize=10,color="white",style="solid",shape="box"];19 -> 14793[label="",style="solid", color="burlywood", weight=9];
14793 -> 21[label="",style="solid", color="burlywood", weight=3];
20[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) xu3)) (Pos (Succ xu400)) (fromEnum xu3) (not (primCmpInt (Pos (Succ xu400)) (fromEnum xu3) == LT))) (fromEnum xu3) (iterate (Pos (Succ xu400) - fromEnum xu3 +) (Pos (Succ xu400) - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) xu3)) (Pos (Succ xu400)) (fromEnum xu3) (not (primCmpInt (Pos (Succ xu400)) (fromEnum xu3) == LT)) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];20 -> 22[label="",style="solid", color="black", weight=3];
21[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) xu3)) (Pos Zero) (fromEnum xu3) (not (primCmpInt (Pos Zero) (fromEnum xu3) == LT))) (fromEnum xu3) (iterate (Pos Zero - fromEnum xu3 +) (Pos Zero - fromEnum xu3 + fromEnum xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) xu3)) (Pos Zero) (fromEnum xu3) (not (primCmpInt (Pos Zero) (fromEnum xu3) == LT)) (fromEnum xu3)))",fontsize=16,color="black",shape="box"];21 -> 23[label="",style="solid", color="black", weight=3];
22[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) xu3)) (Pos (Succ xu400)) (primCharToInt xu3) (not (primCmpInt (Pos (Succ xu400)) (primCharToInt xu3) == LT))) (primCharToInt xu3) (iterate (Pos (Succ xu400) - primCharToInt xu3 +) (Pos (Succ xu400) - primCharToInt xu3 + primCharToInt xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) xu3)) (Pos (Succ xu400)) (primCharToInt xu3) (not (primCmpInt (Pos (Succ xu400)) (primCharToInt xu3) == LT)) (primCharToInt xu3)))",fontsize=16,color="burlywood",shape="box"];14794[label="xu3/Char xu30",fontsize=10,color="white",style="solid",shape="box"];22 -> 14794[label="",style="solid", color="burlywood", weight=9];
14794 -> 24[label="",style="solid", color="burlywood", weight=3];
23[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) xu3)) (Pos Zero) (primCharToInt xu3) (not (primCmpInt (Pos Zero) (primCharToInt xu3) == LT))) (primCharToInt xu3) (iterate (Pos Zero - primCharToInt xu3 +) (Pos Zero - primCharToInt xu3 + primCharToInt xu3)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) xu3)) (Pos Zero) (primCharToInt xu3) (not (primCmpInt (Pos Zero) (primCharToInt xu3) == LT)) (primCharToInt xu3)))",fontsize=16,color="burlywood",shape="box"];14795[label="xu3/Char xu30",fontsize=10,color="white",style="solid",shape="box"];23 -> 14795[label="",style="solid", color="burlywood", weight=9];
14795 -> 25[label="",style="solid", color="burlywood", weight=3];
24[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char xu30))) (Pos (Succ xu400)) (primCharToInt (Char xu30)) (not (primCmpInt (Pos (Succ xu400)) (primCharToInt (Char xu30)) == LT))) (primCharToInt (Char xu30)) (iterate (Pos (Succ xu400) - primCharToInt (Char xu30) +) (Pos (Succ xu400) - primCharToInt (Char xu30) + primCharToInt (Char xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char xu30))) (Pos (Succ xu400)) (primCharToInt (Char xu30)) (not (primCmpInt (Pos (Succ xu400)) (primCharToInt (Char xu30)) == LT)) (primCharToInt (Char xu30))))",fontsize=16,color="black",shape="box"];24 -> 26[label="",style="solid", color="black", weight=3];
25[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char xu30))) (Pos Zero) (primCharToInt (Char xu30)) (not (primCmpInt (Pos Zero) (primCharToInt (Char xu30)) == LT))) (primCharToInt (Char xu30)) (iterate (Pos Zero - primCharToInt (Char xu30) +) (Pos Zero - primCharToInt (Char xu30) + primCharToInt (Char xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char xu30))) (Pos Zero) (primCharToInt (Char xu30)) (not (primCmpInt (Pos Zero) (primCharToInt (Char xu30)) == LT)) (primCharToInt (Char xu30))))",fontsize=16,color="black",shape="box"];25 -> 27[label="",style="solid", color="black", weight=3];
26[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char xu30))) (Pos (Succ xu400)) (Pos xu30) (not (primCmpInt (Pos (Succ xu400)) (Pos xu30) == LT))) (Pos xu30) (iterate (Pos (Succ xu400) - Pos xu30 +) (Pos (Succ xu400) - Pos xu30 + Pos xu30)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char xu30))) (Pos (Succ xu400)) (Pos xu30) (not (primCmpInt (Pos (Succ xu400)) (Pos xu30) == LT)) (Pos xu30)))",fontsize=16,color="black",shape="box"];26 -> 28[label="",style="solid", color="black", weight=3];
27[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char xu30))) (Pos Zero) (Pos xu30) (not (primCmpInt (Pos Zero) (Pos xu30) == LT))) (Pos xu30) (iterate (Pos Zero - Pos xu30 +) (Pos Zero - Pos xu30 + Pos xu30)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char xu30))) (Pos Zero) (Pos xu30) (not (primCmpInt (Pos Zero) (Pos xu30) == LT)) (Pos xu30)))",fontsize=16,color="burlywood",shape="box"];14796[label="xu30/Succ xu300",fontsize=10,color="white",style="solid",shape="box"];27 -> 14796[label="",style="solid", color="burlywood", weight=9];
14796 -> 29[label="",style="solid", color="burlywood", weight=3];
14797[label="xu30/Zero",fontsize=10,color="white",style="solid",shape="box"];27 -> 14797[label="",style="solid", color="burlywood", weight=9];
14797 -> 30[label="",style="solid", color="burlywood", weight=3];
28[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char xu30))) (Pos (Succ xu400)) (Pos xu30) (not (primCmpNat (Succ xu400) xu30 == LT))) (Pos xu30) (iterate (Pos (Succ xu400) - Pos xu30 +) (Pos (Succ xu400) - Pos xu30 + Pos xu30)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char xu30))) (Pos (Succ xu400)) (Pos xu30) (not (primCmpNat (Succ xu400) xu30 == LT)) (Pos xu30)))",fontsize=16,color="burlywood",shape="box"];14798[label="xu30/Succ xu300",fontsize=10,color="white",style="solid",shape="box"];28 -> 14798[label="",style="solid", color="burlywood", weight=9];
14798 -> 31[label="",style="solid", color="burlywood", weight=3];
14799[label="xu30/Zero",fontsize=10,color="white",style="solid",shape="box"];28 -> 14799[label="",style="solid", color="burlywood", weight=9];
14799 -> 32[label="",style="solid", color="burlywood", weight=3];
29[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not (primCmpInt (Pos Zero) (Pos (Succ xu300)) == LT))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not (primCmpInt (Pos Zero) (Pos (Succ xu300)) == LT)) (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];29 -> 33[label="",style="solid", color="black", weight=3];
30[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];30 -> 34[label="",style="solid", color="black", weight=3];
31[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char (Succ xu300)))) (Pos (Succ xu400)) (Pos (Succ xu300)) (not (primCmpNat (Succ xu400) (Succ xu300) == LT))) (Pos (Succ xu300)) (iterate (Pos (Succ xu400) - Pos (Succ xu300) +) (Pos (Succ xu400) - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char (Succ xu300)))) (Pos (Succ xu400)) (Pos (Succ xu300)) (not (primCmpNat (Succ xu400) (Succ xu300) == LT)) (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];31 -> 35[label="",style="solid", color="black", weight=3];
32[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) (not (primCmpNat (Succ xu400) Zero == LT))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) (not (primCmpNat (Succ xu400) Zero == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];32 -> 36[label="",style="solid", color="black", weight=3];
33[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not (primCmpNat Zero (Succ xu300) == LT))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not (primCmpNat Zero (Succ xu300) == LT)) (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];33 -> 37[label="",style="solid", color="black", weight=3];
34[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) (not (EQ == LT))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) (not (EQ == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];34 -> 38[label="",style="solid", color="black", weight=3];
35 -> 498[label="",style="dashed", color="red", weight=0];
35[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char (Succ xu300)))) (Pos (Succ xu400)) (Pos (Succ xu300)) (not (primCmpNat xu400 xu300 == LT))) (Pos (Succ xu300)) (iterate (Pos (Succ xu400) - Pos (Succ xu300) +) (Pos (Succ xu400) - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char (Succ xu300)))) (Pos (Succ xu400)) (Pos (Succ xu300)) (not (primCmpNat xu400 xu300 == LT)) (Pos (Succ xu300))))",fontsize=16,color="magenta"];35 -> 499[label="",style="dashed", color="magenta", weight=3];
35 -> 500[label="",style="dashed", color="magenta", weight=3];
35 -> 501[label="",style="dashed", color="magenta", weight=3];
35 -> 502[label="",style="dashed", color="magenta", weight=3];
36[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) (not (GT == LT))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) (not (GT == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];36 -> 41[label="",style="solid", color="black", weight=3];
37[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not (LT == LT))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not (LT == LT)) (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];37 -> 42[label="",style="solid", color="black", weight=3];
38[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) (not False)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) (not False) (Pos Zero)))",fontsize=16,color="black",shape="box"];38 -> 43[label="",style="solid", color="black", weight=3];
499[label="xu400",fontsize=16,color="green",shape="box"];500[label="xu300",fontsize=16,color="green",shape="box"];501[label="xu400",fontsize=16,color="green",shape="box"];502[label="xu300",fontsize=16,color="green",shape="box"];498[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat xu31 xu32 == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat xu31 xu32 == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14801[label="xu31/Succ xu310",fontsize=10,color="white",style="solid",shape="box"];498 -> 14801[label="",style="solid", color="burlywood", weight=9];
14801 -> 539[label="",style="solid", color="burlywood", weight=3];
14802[label="xu31/Zero",fontsize=10,color="white",style="solid",shape="box"];498 -> 14802[label="",style="solid", color="burlywood", weight=9];
14802 -> 540[label="",style="solid", color="burlywood", weight=3];
41[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) (not False)) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) (not False) (Pos Zero)))",fontsize=16,color="black",shape="box"];41 -> 48[label="",style="solid", color="black", weight=3];
42[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not True)) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) (not True) (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];42 -> 49[label="",style="solid", color="black", weight=3];
43[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) True) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero) (Pos Zero) True (Pos Zero)))",fontsize=16,color="black",shape="box"];43 -> 50[label="",style="solid", color="black", weight=3];
539[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat (Succ xu310) xu32 == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat (Succ xu310) xu32 == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14803[label="xu32/Succ xu320",fontsize=10,color="white",style="solid",shape="box"];539 -> 14803[label="",style="solid", color="burlywood", weight=9];
14803 -> 563[label="",style="solid", color="burlywood", weight=3];
14804[label="xu32/Zero",fontsize=10,color="white",style="solid",shape="box"];539 -> 14804[label="",style="solid", color="burlywood", weight=9];
14804 -> 564[label="",style="solid", color="burlywood", weight=3];
540[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat Zero xu32 == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat Zero xu32 == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14805[label="xu32/Succ xu320",fontsize=10,color="white",style="solid",shape="box"];540 -> 14805[label="",style="solid", color="burlywood", weight=9];
14805 -> 565[label="",style="solid", color="burlywood", weight=3];
14806[label="xu32/Zero",fontsize=10,color="white",style="solid",shape="box"];540 -> 14806[label="",style="solid", color="burlywood", weight=9];
14806 -> 566[label="",style="solid", color="burlywood", weight=3];
48[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) True) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos (Succ xu400)) (Pos Zero) True (Pos Zero)))",fontsize=16,color="black",shape="box"];48 -> 55[label="",style="solid", color="black", weight=3];
49[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) False) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) False (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];49 -> 56[label="",style="solid", color="black", weight=3];
50[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (flip (<=) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) (Pos Zero)))",fontsize=16,color="black",shape="box"];50 -> 57[label="",style="solid", color="black", weight=3];
563[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat (Succ xu310) (Succ xu320) == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat (Succ xu310) (Succ xu320) == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];563 -> 572[label="",style="solid", color="black", weight=3];
564[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat (Succ xu310) Zero == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat (Succ xu310) Zero == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];564 -> 573[label="",style="solid", color="black", weight=3];
565[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat Zero (Succ xu320) == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat Zero (Succ xu320) == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];565 -> 574[label="",style="solid", color="black", weight=3];
566[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat Zero Zero == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat Zero Zero == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];566 -> 575[label="",style="solid", color="black", weight=3];
55[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) (Pos Zero)))",fontsize=16,color="black",shape="box"];55 -> 63[label="",style="solid", color="black", weight=3];
56[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) otherwise) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) otherwise (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];56 -> 64[label="",style="solid", color="black", weight=3];
57[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) ((<=) Pos Zero fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))))",fontsize=16,color="black",shape="box"];57 -> 65[label="",style="solid", color="black", weight=3];
572 -> 498[label="",style="dashed", color="red", weight=0];
572[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat xu310 xu320 == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (primCmpNat xu310 xu320 == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="magenta"];572 -> 580[label="",style="dashed", color="magenta", weight=3];
572 -> 581[label="",style="dashed", color="magenta", weight=3];
573[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (GT == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (GT == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];573 -> 582[label="",style="solid", color="black", weight=3];
574[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (LT == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (LT == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];574 -> 583[label="",style="solid", color="black", weight=3];
575[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (EQ == LT))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not (EQ == LT)) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];575 -> 584[label="",style="solid", color="black", weight=3];
63[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) ((<=) Pos Zero fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))))",fontsize=16,color="black",shape="box"];63 -> 73[label="",style="solid", color="black", weight=3];
64[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) True) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos Zero) (Pos (Succ xu300)) True (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];64 -> 74[label="",style="solid", color="black", weight=3];
65[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (compare (Pos Zero) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) /= GT))",fontsize=16,color="black",shape="box"];65 -> 75[label="",style="solid", color="black", weight=3];
580[label="xu310",fontsize=16,color="green",shape="box"];581[label="xu320",fontsize=16,color="green",shape="box"];582[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not False)) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not False) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="triangle"];582 -> 588[label="",style="solid", color="black", weight=3];
583[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not True)) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not True) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];583 -> 589[label="",style="solid", color="black", weight=3];
584 -> 582[label="",style="dashed", color="red", weight=0];
584[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not False)) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) (not False) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="magenta"];73[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (compare (Pos Zero) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) /= GT))",fontsize=16,color="black",shape="box"];73 -> 83[label="",style="solid", color="black", weight=3];
74[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300))))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (flip (>=) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) (Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];74 -> 84[label="",style="solid", color="black", weight=3];
75[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (compare (Pos Zero) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];75 -> 85[label="",style="solid", color="black", weight=3];
588[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) True) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) True (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];588 -> 593[label="",style="solid", color="black", weight=3];
589[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) False) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP1 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) False (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];589 -> 594[label="",style="solid", color="black", weight=3];
83[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (compare (Pos Zero) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];83 -> 94[label="",style="solid", color="black", weight=3];
84[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300))))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) ((>=) Pos (Succ xu300) fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))))",fontsize=16,color="black",shape="box"];84 -> 95[label="",style="solid", color="black", weight=3];
85[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum (enumFromThenLastChar (Char Zero) (Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];85 -> 96[label="",style="solid", color="black", weight=3];
593[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];593 -> 598[label="",style="solid", color="black", weight=3];
594[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) otherwise) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) otherwise (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];594 -> 599[label="",style="solid", color="black", weight=3];
94[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];94 -> 107[label="",style="solid", color="black", weight=3];
95[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300))))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (compare (Pos (Succ xu300)) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) /= LT))",fontsize=16,color="black",shape="box"];95 -> 108[label="",style="solid", color="black", weight=3];
96[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar (Char Zero) (Char Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar (Char Zero) (Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];96 -> 109[label="",style="solid", color="black", weight=3];
598[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) ((<=) Pos (Succ xu30) fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))))\n  Enum a",fontsize=16,color="black",shape="box"];598 -> 603[label="",style="solid", color="black", weight=3];
599[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) True) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (numericEnumFromThenToP0 (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu29)) (Pos (Succ xu30)) True (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];599 -> 604[label="",style="solid", color="black", weight=3];
107[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar (Char (Succ xu400)) (Char Zero)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar (Char (Succ xu400)) (Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];107 -> 120[label="",style="solid", color="black", weight=3];
108[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300))))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (compare (Pos (Succ xu300)) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) == LT)))",fontsize=16,color="black",shape="box"];108 -> 121[label="",style="solid", color="black", weight=3];
109[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (Char Zero < Char Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (Char Zero < Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];109 -> 122[label="",style="solid", color="black", weight=3];
603[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (compare (Pos (Succ xu30)) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];603 -> 608[label="",style="solid", color="black", weight=3];
604[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (flip (>=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) (Pos (Succ xu30))))\n  Enum a",fontsize=16,color="black",shape="box"];604 -> 609[label="",style="solid", color="black", weight=3];
120[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (Char (Succ xu400) < Char Zero)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (Char (Succ xu400) < Char Zero))) == GT)))",fontsize=16,color="black",shape="box"];120 -> 134[label="",style="solid", color="black", weight=3];
121[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300))))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (fromEnum (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) == LT)))",fontsize=16,color="black",shape="box"];121 -> 135[label="",style="solid", color="black", weight=3];
122[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (compare (Char Zero) (Char Zero) == LT)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (compare (Char Zero) (Char Zero) == LT))) == GT)))",fontsize=16,color="black",shape="box"];122 -> 136[label="",style="solid", color="black", weight=3];
608[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (compare (Pos (Succ xu30)) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];608 -> 613[label="",style="solid", color="black", weight=3];
609[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) ((>=) Pos (Succ xu30) fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))))\n  Enum a",fontsize=16,color="black",shape="box"];609 -> 614[label="",style="solid", color="black", weight=3];
134[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (compare (Char (Succ xu400)) (Char Zero) == LT)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (compare (Char (Succ xu400)) (Char Zero) == LT))) == GT)))",fontsize=16,color="black",shape="box"];134 -> 150[label="",style="solid", color="black", weight=3];
135[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar (Char Zero) (Char (Succ xu300))))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (enumFromThenLastChar (Char Zero) (Char (Succ xu300)))) == LT)))",fontsize=16,color="black",shape="box"];135 -> 151[label="",style="solid", color="black", weight=3];
136[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (primCmpChar (Char Zero) (Char Zero) == LT)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (primCmpChar (Char Zero) (Char Zero) == LT))) == GT)))",fontsize=16,color="black",shape="box"];136 -> 152[label="",style="solid", color="black", weight=3];
613[label="map toEnum (takeWhile1 (flip (<=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];613 -> 618[label="",style="solid", color="black", weight=3];
614[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (compare (Pos (Succ xu30)) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];614 -> 619[label="",style="solid", color="black", weight=3];
150[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (primCmpChar (Char (Succ xu400)) (Char Zero) == LT)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (primCmpChar (Char (Succ xu400)) (Char Zero) == LT))) == GT)))",fontsize=16,color="black",shape="box"];150 -> 166[label="",style="solid", color="black", weight=3];
151[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (Char Zero < Char (Succ xu300))))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (Char Zero < Char (Succ xu300)))) == LT)))",fontsize=16,color="black",shape="box"];151 -> 167[label="",style="solid", color="black", weight=3];
152[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (primCmpNat Zero Zero == LT)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (primCmpNat Zero Zero == LT))) == GT)))",fontsize=16,color="black",shape="box"];152 -> 168[label="",style="solid", color="black", weight=3];
618[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];618 -> 623[label="",style="solid", color="black", weight=3];
619[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (compare (Pos (Succ xu30)) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];619 -> 624[label="",style="solid", color="black", weight=3];
166[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (primCmpNat (Succ xu400) Zero == LT)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (primCmpNat (Succ xu400) Zero == LT))) == GT)))",fontsize=16,color="black",shape="box"];166 -> 183[label="",style="solid", color="black", weight=3];
167[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (compare (Char Zero) (Char (Succ xu300)) == LT)))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (compare (Char Zero) (Char (Succ xu300)) == LT))) == LT)))",fontsize=16,color="black",shape="box"];167 -> 184[label="",style="solid", color="black", weight=3];
168[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (EQ == LT)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) (EQ == LT))) == GT)))",fontsize=16,color="black",shape="box"];168 -> 185[label="",style="solid", color="black", weight=3];
623[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (Char (Succ xu29) < Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (Char (Succ xu29) < Char (Succ xu30)))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];623 -> 628[label="",style="solid", color="black", weight=3];
624[label="map toEnum (takeWhile1 (flip (>=) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (fromEnum (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];624 -> 629[label="",style="solid", color="black", weight=3];
183[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (GT == LT)))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) (GT == LT))) == GT)))",fontsize=16,color="black",shape="box"];183 -> 202[label="",style="solid", color="black", weight=3];
184[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (primCmpChar (Char Zero) (Char (Succ xu300)) == LT)))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (primCmpChar (Char Zero) (Char (Succ xu300)) == LT))) == LT)))",fontsize=16,color="black",shape="box"];184 -> 203[label="",style="solid", color="black", weight=3];
185[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) False))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char Zero) False)) == GT)))",fontsize=16,color="black",shape="box"];185 -> 204[label="",style="solid", color="black", weight=3];
628[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (compare (Char (Succ xu29)) (Char (Succ xu30)) == LT)))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (compare (Char (Succ xu29)) (Char (Succ xu30)) == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];628 -> 633[label="",style="solid", color="black", weight=3];
629[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar (Char (Succ xu29)) (Char (Succ xu30)))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];629 -> 634[label="",style="solid", color="black", weight=3];
202[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) False))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu400)) (Char Zero) False)) == GT)))",fontsize=16,color="black",shape="box"];202 -> 221[label="",style="solid", color="black", weight=3];
203[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (primCmpNat Zero (Succ xu300) == LT)))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (primCmpNat Zero (Succ xu300) == LT))) == LT)))",fontsize=16,color="black",shape="box"];203 -> 222[label="",style="solid", color="black", weight=3];
204[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt maxBound)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt maxBound) == GT)))",fontsize=16,color="black",shape="box"];204 -> 223[label="",style="solid", color="black", weight=3];
633[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpChar (Char (Succ xu29)) (Char (Succ xu30)) == LT)))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpChar (Char (Succ xu29)) (Char (Succ xu30)) == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];633 -> 638[label="",style="solid", color="black", weight=3];
634[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (Char (Succ xu29) < Char (Succ xu30))))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (Char (Succ xu29) < Char (Succ xu30)))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];634 -> 639[label="",style="solid", color="black", weight=3];
221[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt maxBound)) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt maxBound) == GT)))",fontsize=16,color="black",shape="box"];221 -> 241[label="",style="solid", color="black", weight=3];
222[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (LT == LT)))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) (LT == LT))) == LT)))",fontsize=16,color="black",shape="box"];222 -> 242[label="",style="solid", color="black", weight=3];
223 -> 243[label="",style="dashed", color="red", weight=0];
223[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) == GT)))",fontsize=16,color="magenta"];223 -> 244[label="",style="dashed", color="magenta", weight=3];
638 -> 2258[label="",style="dashed", color="red", weight=0];
638[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpNat (Succ xu29) (Succ xu30) == LT)))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpNat (Succ xu29) (Succ xu30) == LT))) == GT)))\n  Enum a",fontsize=16,color="magenta"];638 -> 2259[label="",style="dashed", color="magenta", weight=3];
638 -> 2260[label="",style="dashed", color="magenta", weight=3];
638 -> 2261[label="",style="dashed", color="magenta", weight=3];
638 -> 2262[label="",style="dashed", color="magenta", weight=3];
639[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (compare (Char (Succ xu29)) (Char (Succ xu30)) == LT)))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (compare (Char (Succ xu29)) (Char (Succ xu30)) == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];639 -> 645[label="",style="solid", color="black", weight=3];
241 -> 264[label="",style="dashed", color="red", weight=0];
241[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) (Pos Zero) (iterate (Pos (Succ xu400) - Pos Zero +) (Pos (Succ xu400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) == GT)))",fontsize=16,color="magenta"];241 -> 265[label="",style="dashed", color="magenta", weight=3];
241 -> 266[label="",style="dashed", color="magenta", weight=3];
242[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) True))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (enumFromThenLastChar0 (Char Zero) (Char (Succ xu300)) True)) == LT)))",fontsize=16,color="black",shape="box"];242 -> 267[label="",style="solid", color="black", weight=3];
244[label="Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))",fontsize=16,color="green",shape="box"];243[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char (Succ xu6)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (Char (Succ xu6))) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];243 -> 268[label="",style="solid", color="black", weight=3];
2259[label="Succ xu30",fontsize=16,color="green",shape="box"];2260[label="xu30",fontsize=16,color="green",shape="box"];2261[label="xu29",fontsize=16,color="green",shape="box"];2262[label="Succ xu29",fontsize=16,color="green",shape="box"];2258[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat xu117 xu118 == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat xu117 xu118 == LT))) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14812[label="xu117/Succ xu1170",fontsize=10,color="white",style="solid",shape="box"];2258 -> 14812[label="",style="solid", color="burlywood", weight=9];
14812 -> 2303[label="",style="solid", color="burlywood", weight=3];
14813[label="xu117/Zero",fontsize=10,color="white",style="solid",shape="box"];2258 -> 14813[label="",style="solid", color="burlywood", weight=9];
14813 -> 2304[label="",style="solid", color="burlywood", weight=3];
645[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpChar (Char (Succ xu29)) (Char (Succ xu30)) == LT)))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpChar (Char (Succ xu29)) (Char (Succ xu30)) == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];645 -> 653[label="",style="solid", color="black", weight=3];
265[label="xu400",fontsize=16,color="green",shape="box"];266[label="Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))",fontsize=16,color="green",shape="box"];264[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char (Succ xu8)))) (Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (Char (Succ xu8))) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];264 -> 288[label="",style="solid", color="black", weight=3];
267[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt minBound)) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt minBound) == LT)))",fontsize=16,color="black",shape="box"];267 -> 289[label="",style="solid", color="black", weight=3];
268[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];268 -> 290[label="",style="solid", color="black", weight=3];
2303[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat (Succ xu1170) xu118 == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat (Succ xu1170) xu118 == LT))) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14814[label="xu118/Succ xu1180",fontsize=10,color="white",style="solid",shape="box"];2303 -> 14814[label="",style="solid", color="burlywood", weight=9];
14814 -> 2427[label="",style="solid", color="burlywood", weight=3];
14815[label="xu118/Zero",fontsize=10,color="white",style="solid",shape="box"];2303 -> 14815[label="",style="solid", color="burlywood", weight=9];
14815 -> 2428[label="",style="solid", color="burlywood", weight=3];
2304[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat Zero xu118 == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat Zero xu118 == LT))) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14816[label="xu118/Succ xu1180",fontsize=10,color="white",style="solid",shape="box"];2304 -> 14816[label="",style="solid", color="burlywood", weight=9];
14816 -> 2429[label="",style="solid", color="burlywood", weight=3];
14817[label="xu118/Zero",fontsize=10,color="white",style="solid",shape="box"];2304 -> 14817[label="",style="solid", color="burlywood", weight=9];
14817 -> 2430[label="",style="solid", color="burlywood", weight=3];
653 -> 2531[label="",style="dashed", color="red", weight=0];
653[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpNat (Succ xu29) (Succ xu30) == LT)))) (Pos (Succ xu30)) (iterate (Pos (Succ xu29) - Pos (Succ xu30) +) (Pos (Succ xu29) - Pos (Succ xu30) + Pos (Succ xu30))) (not (primCmpInt (Pos (Succ xu30)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu29)) (Char (Succ xu30)) (primCmpNat (Succ xu29) (Succ xu30) == LT))) == LT)))\n  Enum a",fontsize=16,color="magenta"];653 -> 2532[label="",style="dashed", color="magenta", weight=3];
653 -> 2533[label="",style="dashed", color="magenta", weight=3];
653 -> 2534[label="",style="dashed", color="magenta", weight=3];
653 -> 2535[label="",style="dashed", color="magenta", weight=3];
288[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];288 -> 311[label="",style="solid", color="black", weight=3];
289[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (Char Zero))) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (primCharToInt (Char Zero)) == LT)))",fontsize=16,color="black",shape="box"];289 -> 312[label="",style="solid", color="black", weight=3];
290[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ xu6) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];290 -> 313[label="",style="solid", color="black", weight=3];
2427[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat (Succ xu1170) (Succ xu1180) == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat (Succ xu1170) (Succ xu1180) == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2427 -> 2435[label="",style="solid", color="black", weight=3];
2428[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat (Succ xu1170) Zero == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat (Succ xu1170) Zero == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2428 -> 2436[label="",style="solid", color="black", weight=3];
2429[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat Zero (Succ xu1180) == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat Zero (Succ xu1180) == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2429 -> 2437[label="",style="solid", color="black", weight=3];
2430[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat Zero Zero == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat Zero Zero == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2430 -> 2438[label="",style="solid", color="black", weight=3];
2532[label="xu29",fontsize=16,color="green",shape="box"];2533[label="Succ xu30",fontsize=16,color="green",shape="box"];2534[label="Succ xu29",fontsize=16,color="green",shape="box"];2535[label="xu30",fontsize=16,color="green",shape="box"];2531[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat xu141 xu142 == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat xu141 xu142 == LT))) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14819[label="xu141/Succ xu1410",fontsize=10,color="white",style="solid",shape="box"];2531 -> 14819[label="",style="solid", color="burlywood", weight=9];
14819 -> 2576[label="",style="solid", color="burlywood", weight=3];
14820[label="xu141/Zero",fontsize=10,color="white",style="solid",shape="box"];2531 -> 14820[label="",style="solid", color="burlywood", weight=9];
14820 -> 2577[label="",style="solid", color="burlywood", weight=3];
311[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ xu8) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];311 -> 336[label="",style="solid", color="black", weight=3];
312[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpInt (Pos (Succ xu300)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];312 -> 337[label="",style="solid", color="black", weight=3];
313[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];313 -> 338[label="",style="solid", color="black", weight=3];
2435 -> 2258[label="",style="dashed", color="red", weight=0];
2435[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat xu1170 xu1180 == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (primCmpNat xu1170 xu1180 == LT))) == GT)))\n  Enum a",fontsize=16,color="magenta"];2435 -> 2441[label="",style="dashed", color="magenta", weight=3];
2435 -> 2442[label="",style="dashed", color="magenta", weight=3];
2436[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (GT == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (GT == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2436 -> 2443[label="",style="solid", color="black", weight=3];
2437[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (LT == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (LT == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2437 -> 2444[label="",style="solid", color="black", weight=3];
2438[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (EQ == LT)))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) (EQ == LT))) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2438 -> 2445[label="",style="solid", color="black", weight=3];
2576[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat (Succ xu1410) xu142 == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat (Succ xu1410) xu142 == LT))) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14822[label="xu142/Succ xu1420",fontsize=10,color="white",style="solid",shape="box"];2576 -> 14822[label="",style="solid", color="burlywood", weight=9];
14822 -> 2597[label="",style="solid", color="burlywood", weight=3];
14823[label="xu142/Zero",fontsize=10,color="white",style="solid",shape="box"];2576 -> 14823[label="",style="solid", color="burlywood", weight=9];
14823 -> 2598[label="",style="solid", color="burlywood", weight=3];
2577[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat Zero xu142 == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat Zero xu142 == LT))) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14824[label="xu142/Succ xu1420",fontsize=10,color="white",style="solid",shape="box"];2577 -> 14824[label="",style="solid", color="burlywood", weight=9];
14824 -> 2599[label="",style="solid", color="burlywood", weight=3];
14825[label="xu142/Zero",fontsize=10,color="white",style="solid",shape="box"];2577 -> 14825[label="",style="solid", color="burlywood", weight=9];
14825 -> 2600[label="",style="solid", color="burlywood", weight=3];
336[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];336 -> 364[label="",style="solid", color="black", weight=3];
337[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (primCmpNat (Succ xu300) Zero == LT)))",fontsize=16,color="black",shape="box"];337 -> 365[label="",style="solid", color="black", weight=3];
338[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];338 -> 366[label="",style="solid", color="black", weight=3];
2441[label="xu1180",fontsize=16,color="green",shape="box"];2442[label="xu1170",fontsize=16,color="green",shape="box"];2443[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) False))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) False)) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];2443 -> 2448[label="",style="solid", color="black", weight=3];
2444[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) True))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) True)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2444 -> 2449[label="",style="solid", color="black", weight=3];
2445 -> 2443[label="",style="dashed", color="red", weight=0];
2445[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) False))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu115)) (Char (Succ xu116)) False)) == GT)))\n  Enum a",fontsize=16,color="magenta"];2597[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat (Succ xu1410) (Succ xu1420) == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat (Succ xu1410) (Succ xu1420) == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2597 -> 2615[label="",style="solid", color="black", weight=3];
2598[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat (Succ xu1410) Zero == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat (Succ xu1410) Zero == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2598 -> 2616[label="",style="solid", color="black", weight=3];
2599[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat Zero (Succ xu1420) == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat Zero (Succ xu1420) == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2599 -> 2617[label="",style="solid", color="black", weight=3];
2600[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat Zero Zero == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat Zero Zero == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2600 -> 2618[label="",style="solid", color="black", weight=3];
364[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];364 -> 390[label="",style="solid", color="black", weight=3];
365[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];365 -> 391[label="",style="solid", color="black", weight=3];
366[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) True)\n  Enum a",fontsize=16,color="black",shape="box"];366 -> 392[label="",style="solid", color="black", weight=3];
2448[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt maxBound)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt maxBound) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2448 -> 2454[label="",style="solid", color="black", weight=3];
2449[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt minBound)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt minBound) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2449 -> 2455[label="",style="solid", color="black", weight=3];
2615 -> 2531[label="",style="dashed", color="red", weight=0];
2615[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat xu1410 xu1420 == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (primCmpNat xu1410 xu1420 == LT))) == LT)))\n  Enum a",fontsize=16,color="magenta"];2615 -> 2651[label="",style="dashed", color="magenta", weight=3];
2615 -> 2652[label="",style="dashed", color="magenta", weight=3];
2616[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (GT == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (GT == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2616 -> 2653[label="",style="solid", color="black", weight=3];
2617[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (LT == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (LT == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2617 -> 2654[label="",style="solid", color="black", weight=3];
2618[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (EQ == LT)))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) (EQ == LT))) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2618 -> 2655[label="",style="solid", color="black", weight=3];
390[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)) True)\n  Enum a",fontsize=16,color="black",shape="box"];390 -> 418[label="",style="solid", color="black", weight=3];
391[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) (not False))",fontsize=16,color="black",shape="box"];391 -> 419[label="",style="solid", color="black", weight=3];
392[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos (Succ xu6))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="black",shape="box"];392 -> 420[label="",style="solid", color="black", weight=3];
2454 -> 2459[label="",style="dashed", color="red", weight=0];
2454[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) == GT)))\n  Enum a",fontsize=16,color="magenta"];2454 -> 2460[label="",style="dashed", color="magenta", weight=3];
2454 -> 2461[label="",style="dashed", color="magenta", weight=3];
2454 -> 2462[label="",style="dashed", color="magenta", weight=3];
2455[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char Zero))) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (primCharToInt (Char Zero)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2455 -> 2463[label="",style="solid", color="black", weight=3];
2651[label="xu1420",fontsize=16,color="green",shape="box"];2652[label="xu1410",fontsize=16,color="green",shape="box"];2653[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) False))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) False)) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];2653 -> 2680[label="",style="solid", color="black", weight=3];
2654[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) True))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) True)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2654 -> 2681[label="",style="solid", color="black", weight=3];
2655 -> 2653[label="",style="dashed", color="red", weight=0];
2655[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) False))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (enumFromThenLastChar0 (Char (Succ xu139)) (Char (Succ xu140)) False)) == LT)))\n  Enum a",fontsize=16,color="magenta"];418[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos (Succ xu8))) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="black",shape="box"];418 -> 446[label="",style="solid", color="black", weight=3];
419[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))) True)",fontsize=16,color="black",shape="box"];419 -> 447[label="",style="solid", color="black", weight=3];
420[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu6))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="green",shape="box"];420 -> 448[label="",style="dashed", color="green", weight=3];
420 -> 449[label="",style="dashed", color="green", weight=3];
2460[label="xu116",fontsize=16,color="green",shape="box"];2461[label="xu115",fontsize=16,color="green",shape="box"];2462[label="Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))",fontsize=16,color="green",shape="box"];2459[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char (Succ xu135)))) (Pos (Succ xu136)) (iterate (Pos (Succ xu137) - Pos (Succ xu136) +) (Pos (Succ xu137) - Pos (Succ xu136) + Pos (Succ xu136))) (not (primCmpInt (Pos (Succ xu136)) (primCharToInt (Char (Succ xu135))) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];2459 -> 2464[label="",style="solid", color="black", weight=3];
2463[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpInt (Pos (Succ xu116)) (Pos Zero) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2463 -> 2578[label="",style="solid", color="black", weight=3];
2680[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt maxBound)) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt maxBound) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2680 -> 2707[label="",style="solid", color="black", weight=3];
2681[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt minBound)) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt minBound) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2681 -> 2708[label="",style="solid", color="black", weight=3];
446[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu8))) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="green",shape="box"];446 -> 485[label="",style="dashed", color="green", weight=3];
446 -> 486[label="",style="dashed", color="green", weight=3];
447[label="map toEnum (Pos (Succ xu300) : takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];447 -> 487[label="",style="solid", color="black", weight=3];
448[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];14830[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];448 -> 14830[label="",style="solid", color="blue", weight=9];
14830 -> 488[label="",style="solid", color="blue", weight=3];
14831[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];448 -> 14831[label="",style="solid", color="blue", weight=9];
14831 -> 489[label="",style="solid", color="blue", weight=3];
14832[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];448 -> 14832[label="",style="solid", color="blue", weight=9];
14832 -> 490[label="",style="solid", color="blue", weight=3];
14833[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];448 -> 14833[label="",style="solid", color="blue", weight=9];
14833 -> 491[label="",style="solid", color="blue", weight=3];
14834[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];448 -> 14834[label="",style="solid", color="blue", weight=9];
14834 -> 492[label="",style="solid", color="blue", weight=3];
14835[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];448 -> 14835[label="",style="solid", color="blue", weight=9];
14835 -> 493[label="",style="solid", color="blue", weight=3];
14836[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];448 -> 14836[label="",style="solid", color="blue", weight=9];
14836 -> 494[label="",style="solid", color="blue", weight=3];
14837[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];448 -> 14837[label="",style="solid", color="blue", weight=9];
14837 -> 495[label="",style="solid", color="blue", weight=3];
14838[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];448 -> 14838[label="",style="solid", color="blue", weight=9];
14838 -> 496[label="",style="solid", color="blue", weight=3];
449[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu6))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="black",shape="box"];449 -> 497[label="",style="solid", color="black", weight=3];
2464[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu135))) (Pos (Succ xu136)) (iterate (Pos (Succ xu137) - Pos (Succ xu136) +) (Pos (Succ xu137) - Pos (Succ xu136) + Pos (Succ xu136))) (not (primCmpInt (Pos (Succ xu136)) (Pos (Succ xu135)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2464 -> 2579[label="",style="solid", color="black", weight=3];
2578[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (primCmpNat (Succ xu116) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2578 -> 2601[label="",style="solid", color="black", weight=3];
2707 -> 2761[label="",style="dashed", color="red", weight=0];
2707[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) == LT)))\n  Enum a",fontsize=16,color="magenta"];2707 -> 2762[label="",style="dashed", color="magenta", weight=3];
2707 -> 2763[label="",style="dashed", color="magenta", weight=3];
2707 -> 2764[label="",style="dashed", color="magenta", weight=3];
2708[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (Char Zero))) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (primCharToInt (Char Zero)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2708 -> 2765[label="",style="solid", color="black", weight=3];
485[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];14840[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];485 -> 14840[label="",style="solid", color="blue", weight=9];
14840 -> 541[label="",style="solid", color="blue", weight=3];
14841[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];485 -> 14841[label="",style="solid", color="blue", weight=9];
14841 -> 542[label="",style="solid", color="blue", weight=3];
14842[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];485 -> 14842[label="",style="solid", color="blue", weight=9];
14842 -> 543[label="",style="solid", color="blue", weight=3];
14843[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];485 -> 14843[label="",style="solid", color="blue", weight=9];
14843 -> 544[label="",style="solid", color="blue", weight=3];
14844[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];485 -> 14844[label="",style="solid", color="blue", weight=9];
14844 -> 545[label="",style="solid", color="blue", weight=3];
14845[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];485 -> 14845[label="",style="solid", color="blue", weight=9];
14845 -> 546[label="",style="solid", color="blue", weight=3];
14846[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];485 -> 14846[label="",style="solid", color="blue", weight=9];
14846 -> 547[label="",style="solid", color="blue", weight=3];
14847[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];485 -> 14847[label="",style="solid", color="blue", weight=9];
14847 -> 548[label="",style="solid", color="blue", weight=3];
14848[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];485 -> 14848[label="",style="solid", color="blue", weight=9];
14848 -> 549[label="",style="solid", color="blue", weight=3];
486[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu8))) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="black",shape="box"];486 -> 550[label="",style="solid", color="black", weight=3];
487[label="toEnum (Pos (Succ xu300)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))))",fontsize=16,color="green",shape="box"];487 -> 551[label="",style="dashed", color="green", weight=3];
487 -> 552[label="",style="dashed", color="green", weight=3];
488[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];488 -> 553[label="",style="solid", color="black", weight=3];
489[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];489 -> 554[label="",style="solid", color="black", weight=3];
490[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="black",shape="triangle"];490 -> 555[label="",style="solid", color="black", weight=3];
491[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];491 -> 556[label="",style="solid", color="black", weight=3];
492[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];492 -> 557[label="",style="solid", color="black", weight=3];
493[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];493 -> 558[label="",style="solid", color="black", weight=3];
494[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];494 -> 559[label="",style="solid", color="black", weight=3];
495[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];495 -> 560[label="",style="solid", color="black", weight=3];
496[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];496 -> 561[label="",style="solid", color="black", weight=3];
497[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu6))) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];497 -> 562[label="",style="solid", color="black", weight=3];
2579 -> 3992[label="",style="dashed", color="red", weight=0];
2579[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu135))) (Pos (Succ xu136)) (iterate (Pos (Succ xu137) - Pos (Succ xu136) +) (Pos (Succ xu137) - Pos (Succ xu136) + Pos (Succ xu136))) (not (primCmpNat (Succ xu136) (Succ xu135) == GT)))\n  Enum a",fontsize=16,color="magenta"];2579 -> 3993[label="",style="dashed", color="magenta", weight=3];
2579 -> 3994[label="",style="dashed", color="magenta", weight=3];
2579 -> 3995[label="",style="dashed", color="magenta", weight=3];
2579 -> 3996[label="",style="dashed", color="magenta", weight=3];
2579 -> 3997[label="",style="dashed", color="magenta", weight=3];
2601[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];2601 -> 2619[label="",style="solid", color="black", weight=3];
2762[label="xu140",fontsize=16,color="green",shape="box"];2763[label="xu139",fontsize=16,color="green",shape="box"];2764[label="Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))",fontsize=16,color="green",shape="box"];2761[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (Char (Succ xu154)))) (Pos (Succ xu155)) (iterate (Pos (Succ xu156) - Pos (Succ xu155) +) (Pos (Succ xu156) - Pos (Succ xu155) + Pos (Succ xu155))) (not (primCmpInt (Pos (Succ xu155)) (primCharToInt (Char (Succ xu154))) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];2761 -> 2766[label="",style="solid", color="black", weight=3];
2765[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpInt (Pos (Succ xu140)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2765 -> 2781[label="",style="solid", color="black", weight=3];
541 -> 488[label="",style="dashed", color="red", weight=0];
541[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];542 -> 489[label="",style="dashed", color="red", weight=0];
542[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];543 -> 490[label="",style="dashed", color="red", weight=0];
543[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="magenta"];544 -> 491[label="",style="dashed", color="red", weight=0];
544[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];545 -> 492[label="",style="dashed", color="red", weight=0];
545[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];546 -> 493[label="",style="dashed", color="red", weight=0];
546[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];547 -> 494[label="",style="dashed", color="red", weight=0];
547[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];548 -> 495[label="",style="dashed", color="red", weight=0];
548[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];549 -> 496[label="",style="dashed", color="red", weight=0];
549[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];550[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu8))) (Pos (Succ xu9) - Pos Zero + Pos Zero : iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + (Pos (Succ xu9) - Pos Zero + Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];550 -> 567[label="",style="solid", color="black", weight=3];
551[label="toEnum (Pos (Succ xu300))",fontsize=16,color="black",shape="triangle"];551 -> 4048[label="",style="solid", color="black", weight=3];
552[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];552 -> 569[label="",style="solid", color="black", weight=3];
553[label="error []",fontsize=16,color="red",shape="box"];554[label="error []",fontsize=16,color="red",shape="box"];555[label="error []",fontsize=16,color="red",shape="box"];556[label="error []",fontsize=16,color="red",shape="box"];557[label="error []",fontsize=16,color="red",shape="box"];558[label="error []",fontsize=16,color="red",shape="box"];559[label="error []",fontsize=16,color="red",shape="box"];560[label="error []",fontsize=16,color="red",shape="box"];561[label="primIntToChar (Pos Zero)",fontsize=16,color="black",shape="box"];561 -> 570[label="",style="solid", color="black", weight=3];
562[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu6))) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];562 -> 571[label="",style="solid", color="black", weight=3];
3993[label="xu135",fontsize=16,color="green",shape="box"];3994[label="xu136",fontsize=16,color="green",shape="box"];3995[label="Succ xu135",fontsize=16,color="green",shape="box"];3996[label="xu137",fontsize=16,color="green",shape="box"];3997[label="Succ xu136",fontsize=16,color="green",shape="box"];3992[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat xu199 xu200 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14859[label="xu199/Succ xu1990",fontsize=10,color="white",style="solid",shape="box"];3992 -> 14859[label="",style="solid", color="burlywood", weight=9];
14859 -> 4049[label="",style="solid", color="burlywood", weight=3];
14860[label="xu199/Zero",fontsize=10,color="white",style="solid",shape="box"];3992 -> 14860[label="",style="solid", color="burlywood", weight=9];
14860 -> 4050[label="",style="solid", color="burlywood", weight=3];
2619[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];2619 -> 2656[label="",style="solid", color="black", weight=3];
2766[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu154))) (Pos (Succ xu155)) (iterate (Pos (Succ xu156) - Pos (Succ xu155) +) (Pos (Succ xu156) - Pos (Succ xu155) + Pos (Succ xu155))) (not (primCmpInt (Pos (Succ xu155)) (Pos (Succ xu154)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2766 -> 2782[label="",style="solid", color="black", weight=3];
2781[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (primCmpNat (Succ xu140) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2781 -> 2790[label="",style="solid", color="black", weight=3];
567[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu8))) (Pos (Succ xu9) - Pos Zero + Pos Zero : iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + (Pos (Succ xu9) - Pos Zero + Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];567 -> 576[label="",style="solid", color="black", weight=3];
4048[label="primIntToChar (Pos (Succ xu300))",fontsize=16,color="black",shape="triangle"];4048 -> 4190[label="",style="solid", color="black", weight=3];
569[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300) : iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)))))",fontsize=16,color="black",shape="box"];569 -> 578[label="",style="solid", color="black", weight=3];
570[label="Char Zero",fontsize=16,color="green",shape="box"];571[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (flip (<=) (Pos (Succ xu6)) (Pos Zero - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="black",shape="box"];571 -> 579[label="",style="solid", color="black", weight=3];
4049[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat (Succ xu1990) xu200 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14861[label="xu200/Succ xu2000",fontsize=10,color="white",style="solid",shape="box"];4049 -> 14861[label="",style="solid", color="burlywood", weight=9];
14861 -> 4191[label="",style="solid", color="burlywood", weight=3];
14862[label="xu200/Zero",fontsize=10,color="white",style="solid",shape="box"];4049 -> 14862[label="",style="solid", color="burlywood", weight=9];
14862 -> 4192[label="",style="solid", color="burlywood", weight=3];
4050[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat Zero xu200 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14863[label="xu200/Succ xu2000",fontsize=10,color="white",style="solid",shape="box"];4050 -> 14863[label="",style="solid", color="burlywood", weight=9];
14863 -> 4193[label="",style="solid", color="burlywood", weight=3];
14864[label="xu200/Zero",fontsize=10,color="white",style="solid",shape="box"];4050 -> 14864[label="",style="solid", color="burlywood", weight=9];
14864 -> 4194[label="",style="solid", color="burlywood", weight=3];
2656[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) False)\n  Enum a",fontsize=16,color="black",shape="box"];2656 -> 2682[label="",style="solid", color="black", weight=3];
2782 -> 4428[label="",style="dashed", color="red", weight=0];
2782[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu154))) (Pos (Succ xu155)) (iterate (Pos (Succ xu156) - Pos (Succ xu155) +) (Pos (Succ xu156) - Pos (Succ xu155) + Pos (Succ xu155))) (not (primCmpNat (Succ xu155) (Succ xu154) == LT)))\n  Enum a",fontsize=16,color="magenta"];2782 -> 4429[label="",style="dashed", color="magenta", weight=3];
2782 -> 4430[label="",style="dashed", color="magenta", weight=3];
2782 -> 4431[label="",style="dashed", color="magenta", weight=3];
2782 -> 4432[label="",style="dashed", color="magenta", weight=3];
2782 -> 4433[label="",style="dashed", color="magenta", weight=3];
2790[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2790 -> 2805[label="",style="solid", color="black", weight=3];
576[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos (Succ xu9) - Pos Zero + Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + (Pos (Succ xu9) - Pos Zero + Pos Zero))) (flip (<=) (Pos (Succ xu8)) (Pos (Succ xu9) - Pos Zero + Pos Zero)))\n  Enum a",fontsize=16,color="black",shape="box"];576 -> 585[label="",style="solid", color="black", weight=3];
4190[label="Char (Succ xu300)",fontsize=16,color="green",shape="box"];578[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300) : iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)))))",fontsize=16,color="black",shape="box"];578 -> 586[label="",style="solid", color="black", weight=3];
579[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) ((<=) Pos Zero - Pos Zero + Pos Zero Pos (Succ xu6)))\n  Enum a",fontsize=16,color="black",shape="box"];579 -> 587[label="",style="solid", color="black", weight=3];
4191[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat (Succ xu1990) (Succ xu2000) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4191 -> 4264[label="",style="solid", color="black", weight=3];
4192[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat (Succ xu1990) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4192 -> 4265[label="",style="solid", color="black", weight=3];
4193[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat Zero (Succ xu2000) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4193 -> 4266[label="",style="solid", color="black", weight=3];
4194[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4194 -> 4267[label="",style="solid", color="black", weight=3];
2682[label="map toEnum (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];2682 -> 2709[label="",style="solid", color="black", weight=3];
4429[label="xu154",fontsize=16,color="green",shape="box"];4430[label="xu156",fontsize=16,color="green",shape="box"];4431[label="Succ xu155",fontsize=16,color="green",shape="box"];4432[label="xu155",fontsize=16,color="green",shape="box"];4433[label="Succ xu154",fontsize=16,color="green",shape="box"];4428[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat xu207 xu208 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14866[label="xu207/Succ xu2070",fontsize=10,color="white",style="solid",shape="box"];4428 -> 14866[label="",style="solid", color="burlywood", weight=9];
14866 -> 4484[label="",style="solid", color="burlywood", weight=3];
14867[label="xu207/Zero",fontsize=10,color="white",style="solid",shape="box"];4428 -> 14867[label="",style="solid", color="burlywood", weight=9];
14867 -> 4485[label="",style="solid", color="burlywood", weight=3];
2805[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];2805 -> 2867[label="",style="solid", color="black", weight=3];
585[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos (Succ xu9) - Pos Zero + Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + (Pos (Succ xu9) - Pos Zero + Pos Zero))) ((<=) Pos (Succ xu9) - Pos Zero + Pos Zero Pos (Succ xu8)))\n  Enum a",fontsize=16,color="black",shape="box"];585 -> 590[label="",style="solid", color="black", weight=3];
586[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)))) (flip (>=) (Pos Zero) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300))))",fontsize=16,color="black",shape="box"];586 -> 591[label="",style="solid", color="black", weight=3];
587[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (compare (Pos Zero - Pos Zero + Pos Zero) (Pos (Succ xu6)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];587 -> 592[label="",style="solid", color="black", weight=3];
4264 -> 3992[label="",style="dashed", color="red", weight=0];
4264[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (primCmpNat xu1990 xu2000 == GT)))\n  Enum a",fontsize=16,color="magenta"];4264 -> 4289[label="",style="dashed", color="magenta", weight=3];
4264 -> 4290[label="",style="dashed", color="magenta", weight=3];
4265[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4265 -> 4291[label="",style="solid", color="black", weight=3];
4266[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4266 -> 4292[label="",style="solid", color="black", weight=3];
4267[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4267 -> 4293[label="",style="solid", color="black", weight=3];
2709[label="map toEnum (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ xu116)) (iterate (Pos (Succ xu115) - Pos (Succ xu116) +) (Pos (Succ xu115) - Pos (Succ xu116) + Pos (Succ xu116))) True)\n  Enum a",fontsize=16,color="black",shape="box"];2709 -> 2767[label="",style="solid", color="black", weight=3];
4484[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat (Succ xu2070) xu208 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14869[label="xu208/Succ xu2080",fontsize=10,color="white",style="solid",shape="box"];4484 -> 14869[label="",style="solid", color="burlywood", weight=9];
14869 -> 4507[label="",style="solid", color="burlywood", weight=3];
14870[label="xu208/Zero",fontsize=10,color="white",style="solid",shape="box"];4484 -> 14870[label="",style="solid", color="burlywood", weight=9];
14870 -> 4508[label="",style="solid", color="burlywood", weight=3];
4485[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat Zero xu208 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14871[label="xu208/Succ xu2080",fontsize=10,color="white",style="solid",shape="box"];4485 -> 14871[label="",style="solid", color="burlywood", weight=9];
14871 -> 4509[label="",style="solid", color="burlywood", weight=3];
14872[label="xu208/Zero",fontsize=10,color="white",style="solid",shape="box"];4485 -> 14872[label="",style="solid", color="burlywood", weight=9];
14872 -> 4510[label="",style="solid", color="burlywood", weight=3];
2867[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))) True)\n  Enum a",fontsize=16,color="black",shape="box"];2867 -> 2887[label="",style="solid", color="black", weight=3];
590[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos (Succ xu9) - Pos Zero + Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + (Pos (Succ xu9) - Pos Zero + Pos Zero))) (compare (Pos (Succ xu9) - Pos Zero + Pos Zero) (Pos (Succ xu8)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];590 -> 595[label="",style="solid", color="black", weight=3];
591[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)))) ((>=) Pos Zero - Pos (Succ xu300) + Pos (Succ xu300) Pos Zero))",fontsize=16,color="black",shape="box"];591 -> 596[label="",style="solid", color="black", weight=3];
592[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (not (compare (Pos Zero - Pos Zero + Pos Zero) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];592 -> 597[label="",style="solid", color="black", weight=3];
4289[label="xu2000",fontsize=16,color="green",shape="box"];4290[label="xu1990",fontsize=16,color="green",shape="box"];4291[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];4291 -> 4343[label="",style="solid", color="black", weight=3];
4292[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];4292 -> 4344[label="",style="solid", color="black", weight=3];
4293 -> 4292[label="",style="dashed", color="red", weight=0];
4293[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) (not False))\n  Enum a",fontsize=16,color="magenta"];2767 -> 808[label="",style="dashed", color="red", weight=0];
2767[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];4507[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat (Succ xu2070) (Succ xu2080) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];4507 -> 4536[label="",style="solid", color="black", weight=3];
4508[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat (Succ xu2070) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];4508 -> 4537[label="",style="solid", color="black", weight=3];
4509[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat Zero (Succ xu2080) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];4509 -> 4538[label="",style="solid", color="black", weight=3];
4510[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];4510 -> 4539[label="",style="solid", color="black", weight=3];
2887[label="map toEnum (Pos (Succ xu140) : takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))))\n  Enum a",fontsize=16,color="black",shape="box"];2887 -> 2925[label="",style="solid", color="black", weight=3];
595[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos (Succ xu9) - Pos Zero + Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + (Pos (Succ xu9) - Pos Zero + Pos Zero))) (not (compare (Pos (Succ xu9) - Pos Zero + Pos Zero) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];595 -> 600[label="",style="solid", color="black", weight=3];
596[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)))) (compare (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (Pos Zero) /= LT))",fontsize=16,color="black",shape="box"];596 -> 601[label="",style="solid", color="black", weight=3];
597[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (not (primCmpInt (Pos Zero - Pos Zero + Pos Zero) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];597 -> 602[label="",style="solid", color="black", weight=3];
4343[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) False)\n  Enum a",fontsize=16,color="black",shape="box"];4343 -> 4486[label="",style="solid", color="black", weight=3];
4344[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) True)\n  Enum a",fontsize=16,color="black",shape="box"];4344 -> 4487[label="",style="solid", color="black", weight=3];
808[label="map toEnum []\n  Enum a",fontsize=16,color="black",shape="triangle"];808 -> 844[label="",style="solid", color="black", weight=3];
4536 -> 4428[label="",style="dashed", color="red", weight=0];
4536[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (primCmpNat xu2070 xu2080 == LT)))\n  Enum a",fontsize=16,color="magenta"];4536 -> 4584[label="",style="dashed", color="magenta", weight=3];
4536 -> 4585[label="",style="dashed", color="magenta", weight=3];
4537[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];4537 -> 4586[label="",style="solid", color="black", weight=3];
4538[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];4538 -> 4587[label="",style="solid", color="black", weight=3];
4539[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];4539 -> 4588[label="",style="solid", color="black", weight=3];
2925[label="toEnum (Pos (Succ xu140)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))))\n  Enum a",fontsize=16,color="green",shape="box"];2925 -> 2960[label="",style="dashed", color="green", weight=3];
2925 -> 2961[label="",style="dashed", color="green", weight=3];
600[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos (Succ xu9) - Pos Zero + Pos Zero) (iterate (Pos (Succ xu9) - Pos Zero +) (Pos (Succ xu9) - Pos Zero + (Pos (Succ xu9) - Pos Zero + Pos Zero))) (not (primCmpInt (Pos (Succ xu9) - Pos Zero + Pos Zero) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];600 -> 605[label="",style="solid", color="black", weight=3];
601[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)))) (not (compare (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];601 -> 606[label="",style="solid", color="black", weight=3];
602[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero - Pos Zero)) (primPlusInt (Pos Zero - Pos Zero) (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];602 -> 607[label="",style="solid", color="black", weight=3];
4486[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];4486 -> 4511[label="",style="solid", color="black", weight=3];
4487[label="map toEnum (Pos (Succ xu197) : takeWhile (flip (<=) (Pos (Succ xu196))) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))))\n  Enum a",fontsize=16,color="black",shape="box"];4487 -> 4512[label="",style="solid", color="black", weight=3];
844[label="[]\n  Enum a",fontsize=16,color="green",shape="box"];4584[label="xu2070",fontsize=16,color="green",shape="box"];4585[label="xu2080",fontsize=16,color="green",shape="box"];4586[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];4586 -> 4646[label="",style="solid", color="black", weight=3];
4587[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];4587 -> 4647[label="",style="solid", color="black", weight=3];
4588 -> 4586[label="",style="dashed", color="red", weight=0];
4588[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) (not False))\n  Enum a",fontsize=16,color="magenta"];2960[label="toEnum (Pos (Succ xu140))\n  Enum a",fontsize=16,color="blue",shape="box"];14877[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14877[label="",style="solid", color="blue", weight=9];
14877 -> 3004[label="",style="solid", color="blue", weight=3];
14878[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14878[label="",style="solid", color="blue", weight=9];
14878 -> 3005[label="",style="solid", color="blue", weight=3];
14879[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14879[label="",style="solid", color="blue", weight=9];
14879 -> 3006[label="",style="solid", color="blue", weight=3];
14880[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14880[label="",style="solid", color="blue", weight=9];
14880 -> 3007[label="",style="solid", color="blue", weight=3];
14881[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14881[label="",style="solid", color="blue", weight=9];
14881 -> 3008[label="",style="solid", color="blue", weight=3];
14882[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14882[label="",style="solid", color="blue", weight=9];
14882 -> 3009[label="",style="solid", color="blue", weight=3];
14883[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14883[label="",style="solid", color="blue", weight=9];
14883 -> 3010[label="",style="solid", color="blue", weight=3];
14884[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14884[label="",style="solid", color="blue", weight=9];
14884 -> 3011[label="",style="solid", color="blue", weight=3];
14885[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];2960 -> 14885[label="",style="solid", color="blue", weight=9];
14885 -> 3012[label="",style="solid", color="blue", weight=3];
2961[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))))\n  Enum a",fontsize=16,color="black",shape="box"];2961 -> 3013[label="",style="solid", color="black", weight=3];
605[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (primPlusInt (Pos (Succ xu9) - Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos (Succ xu9) - Pos Zero)) (primPlusInt (Pos (Succ xu9) - Pos Zero) (primPlusInt (Pos (Succ xu9) - Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos (Succ xu9) - Pos Zero) (Pos Zero)) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];605 -> 610[label="",style="solid", color="black", weight=3];
606[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (iterate (Pos Zero - Pos (Succ xu300) +) (Pos Zero - Pos (Succ xu300) + (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)))) (not (primCmpInt (Pos Zero - Pos (Succ xu300) + Pos (Succ xu300)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];606 -> 611[label="",style="solid", color="black", weight=3];
607[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)) (iterate (primPlusInt (primMinusInt (Pos Zero) (Pos Zero))) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];607 -> 612[label="",style="solid", color="black", weight=3];
4511[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))) True)\n  Enum a",fontsize=16,color="black",shape="box"];4511 -> 4540[label="",style="solid", color="black", weight=3];
4512[label="toEnum (Pos (Succ xu197)) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu196))) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))))\n  Enum a",fontsize=16,color="green",shape="box"];4512 -> 4541[label="",style="dashed", color="green", weight=3];
4512 -> 4542[label="",style="dashed", color="green", weight=3];
4646[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) True)\n  Enum a",fontsize=16,color="black",shape="box"];4646 -> 4708[label="",style="solid", color="black", weight=3];
4647[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) False)\n  Enum a",fontsize=16,color="black",shape="box"];4647 -> 4709[label="",style="solid", color="black", weight=3];
3004[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="triangle"];3004 -> 4051[label="",style="solid", color="black", weight=3];
3005[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="triangle"];3005 -> 4052[label="",style="solid", color="black", weight=3];
3006[label="toEnum (Pos (Succ xu140))\n  Integral a",fontsize=16,color="black",shape="triangle"];3006 -> 4053[label="",style="solid", color="black", weight=3];
3007[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="triangle"];3007 -> 4054[label="",style="solid", color="black", weight=3];
3008[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="triangle"];3008 -> 4055[label="",style="solid", color="black", weight=3];
3009[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="triangle"];3009 -> 4056[label="",style="solid", color="black", weight=3];
3010[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="triangle"];3010 -> 4057[label="",style="solid", color="black", weight=3];
3011[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="triangle"];3011 -> 4058[label="",style="solid", color="black", weight=3];
3012[label="toEnum (Pos (Succ xu140))",fontsize=16,color="black",shape="box"];3012 -> 4059[label="",style="solid", color="black", weight=3];
3013[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140) : iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)))))\n  Enum a",fontsize=16,color="black",shape="box"];3013 -> 3055[label="",style="solid", color="black", weight=3];
610[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (primPlusInt (primMinusInt (Pos (Succ xu9)) (Pos Zero)) (Pos Zero)) (iterate (primPlusInt (primMinusInt (Pos (Succ xu9)) (Pos Zero))) (primPlusInt (primMinusInt (Pos (Succ xu9)) (Pos Zero)) (primPlusInt (primMinusInt (Pos (Succ xu9)) (Pos Zero)) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ xu9)) (Pos Zero)) (Pos Zero)) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];610 -> 615[label="",style="solid", color="black", weight=3];
611[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero - Pos (Succ xu300)) (Pos (Succ xu300))) (iterate (primPlusInt (Pos Zero - Pos (Succ xu300))) (primPlusInt (Pos Zero - Pos (Succ xu300)) (primPlusInt (Pos Zero - Pos (Succ xu300)) (Pos (Succ xu300))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ xu300)) (Pos (Succ xu300))) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];611 -> 616[label="",style="solid", color="black", weight=3];
612[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (primPlusInt (primMinusNat Zero Zero) (Pos Zero)) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos Zero)) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];612 -> 617[label="",style="solid", color="black", weight=3];
4540 -> 808[label="",style="dashed", color="red", weight=0];
4540[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];4541[label="toEnum (Pos (Succ xu197))\n  Enum a",fontsize=16,color="blue",shape="box"];14887[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14887[label="",style="solid", color="blue", weight=9];
14887 -> 4589[label="",style="solid", color="blue", weight=3];
14888[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14888[label="",style="solid", color="blue", weight=9];
14888 -> 4590[label="",style="solid", color="blue", weight=3];
14889[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14889[label="",style="solid", color="blue", weight=9];
14889 -> 4591[label="",style="solid", color="blue", weight=3];
14890[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14890[label="",style="solid", color="blue", weight=9];
14890 -> 4592[label="",style="solid", color="blue", weight=3];
14891[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14891[label="",style="solid", color="blue", weight=9];
14891 -> 4593[label="",style="solid", color="blue", weight=3];
14892[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14892[label="",style="solid", color="blue", weight=9];
14892 -> 4594[label="",style="solid", color="blue", weight=3];
14893[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14893[label="",style="solid", color="blue", weight=9];
14893 -> 4595[label="",style="solid", color="blue", weight=3];
14894[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14894[label="",style="solid", color="blue", weight=9];
14894 -> 4596[label="",style="solid", color="blue", weight=3];
14895[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];4541 -> 14895[label="",style="solid", color="blue", weight=9];
14895 -> 4597[label="",style="solid", color="blue", weight=3];
4542[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu196))) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))))\n  Enum a",fontsize=16,color="black",shape="box"];4542 -> 4598[label="",style="solid", color="black", weight=3];
4708[label="map toEnum (Pos (Succ xu205) : takeWhile (flip (>=) (Pos (Succ xu204))) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))))\n  Enum a",fontsize=16,color="black",shape="box"];4708 -> 4765[label="",style="solid", color="black", weight=3];
4709[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];4709 -> 4766[label="",style="solid", color="black", weight=3];
4051[label="error []",fontsize=16,color="red",shape="box"];4052[label="error []",fontsize=16,color="red",shape="box"];4053[label="error []",fontsize=16,color="red",shape="box"];4054[label="error []",fontsize=16,color="red",shape="box"];4055[label="error []",fontsize=16,color="red",shape="box"];4056[label="error []",fontsize=16,color="red",shape="box"];4057[label="error []",fontsize=16,color="red",shape="box"];4058[label="error []",fontsize=16,color="red",shape="box"];4059 -> 4048[label="",style="dashed", color="red", weight=0];
4059[label="primIntToChar (Pos (Succ xu140))",fontsize=16,color="magenta"];4059 -> 4195[label="",style="dashed", color="magenta", weight=3];
3055[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140) : iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)))))\n  Enum a",fontsize=16,color="black",shape="box"];3055 -> 3083[label="",style="solid", color="black", weight=3];
615[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (primPlusInt (primMinusNat (Succ xu9) Zero) (Pos Zero)) (iterate (primPlusInt (primMinusNat (Succ xu9) Zero)) (primPlusInt (primMinusNat (Succ xu9) Zero) (primPlusInt (primMinusNat (Succ xu9) Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu9) Zero) (Pos Zero)) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];615 -> 620[label="",style="solid", color="black", weight=3];
616[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ xu300))) (Pos (Succ xu300))) (iterate (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ xu300)))) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ xu300))) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ xu300))) (Pos (Succ xu300))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ xu300))) (Pos (Succ xu300))) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];616 -> 621[label="",style="solid", color="black", weight=3];
617[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos Zero)) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];617 -> 622[label="",style="solid", color="black", weight=3];
4589[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4589 -> 4836[label="",style="solid", color="black", weight=3];
4590[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4590 -> 4879[label="",style="solid", color="black", weight=3];
4591[label="toEnum (Pos (Succ xu197))\n  Integral a",fontsize=16,color="black",shape="box"];4591 -> 4834[label="",style="solid", color="black", weight=3];
4592[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4592 -> 4842[label="",style="solid", color="black", weight=3];
4593[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4593 -> 4829[label="",style="solid", color="black", weight=3];
4594[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4594 -> 4840[label="",style="solid", color="black", weight=3];
4595[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4595 -> 4841[label="",style="solid", color="black", weight=3];
4596[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4596 -> 4849[label="",style="solid", color="black", weight=3];
4597[label="toEnum (Pos (Succ xu197))",fontsize=16,color="black",shape="box"];4597 -> 4878[label="",style="solid", color="black", weight=3];
4598[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197) : iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)))))\n  Enum a",fontsize=16,color="black",shape="box"];4598 -> 4657[label="",style="solid", color="black", weight=3];
4765[label="toEnum (Pos (Succ xu205)) : map toEnum (takeWhile (flip (>=) (Pos (Succ xu204))) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))))\n  Enum a",fontsize=16,color="green",shape="box"];4765 -> 4825[label="",style="dashed", color="green", weight=3];
4765 -> 4826[label="",style="dashed", color="green", weight=3];
4766[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))) True)\n  Enum a",fontsize=16,color="black",shape="box"];4766 -> 4827[label="",style="solid", color="black", weight=3];
4195[label="xu140",fontsize=16,color="green",shape="box"];3083[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)))) (flip (>=) (Pos Zero) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140))))\n  Enum a",fontsize=16,color="black",shape="box"];3083 -> 3130[label="",style="solid", color="black", weight=3];
620[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (primPlusInt (Pos (Succ xu9)) (Pos Zero)) (iterate (primPlusInt (Pos (Succ xu9))) (primPlusInt (Pos (Succ xu9)) (primPlusInt (Pos (Succ xu9)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos (Succ xu9)) (Pos Zero)) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];620 -> 625[label="",style="solid", color="black", weight=3];
621 -> 5553[label="",style="dashed", color="red", weight=0];
621[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero (Succ xu300)) (Pos (Succ xu300))) (iterate (primPlusInt (primMinusNat Zero (Succ xu300))) (primPlusInt (primMinusNat Zero (Succ xu300)) (primPlusInt (primMinusNat Zero (Succ xu300)) (Pos (Succ xu300))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ xu300)) (Pos (Succ xu300))) (Pos Zero) == LT)))",fontsize=16,color="magenta"];621 -> 5554[label="",style="dashed", color="magenta", weight=3];
621 -> 5555[label="",style="dashed", color="magenta", weight=3];
621 -> 5556[label="",style="dashed", color="magenta", weight=3];
622 -> 6269[label="",style="dashed", color="red", weight=0];
622[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu6))) (Pos (primPlusNat Zero Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero Zero)))) (not (primCmpInt (Pos (primPlusNat Zero Zero)) (Pos (Succ xu6)) == GT)))\n  Enum a",fontsize=16,color="magenta"];622 -> 6270[label="",style="dashed", color="magenta", weight=3];
622 -> 6271[label="",style="dashed", color="magenta", weight=3];
622 -> 6272[label="",style="dashed", color="magenta", weight=3];
622 -> 6273[label="",style="dashed", color="magenta", weight=3];
4836[label="error []",fontsize=16,color="red",shape="box"];4879[label="error []",fontsize=16,color="red",shape="box"];4834[label="error []",fontsize=16,color="red",shape="box"];4842[label="error []",fontsize=16,color="red",shape="box"];4829[label="error []",fontsize=16,color="red",shape="box"];4840[label="error []",fontsize=16,color="red",shape="box"];4841[label="error []",fontsize=16,color="red",shape="box"];4849[label="error []",fontsize=16,color="red",shape="box"];4878 -> 4048[label="",style="dashed", color="red", weight=0];
4878[label="primIntToChar (Pos (Succ xu197))",fontsize=16,color="magenta"];4878 -> 4907[label="",style="dashed", color="magenta", weight=3];
4657[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197) : iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)))))\n  Enum a",fontsize=16,color="black",shape="box"];4657 -> 4710[label="",style="solid", color="black", weight=3];
4825[label="toEnum (Pos (Succ xu205))\n  Enum a",fontsize=16,color="blue",shape="box"];14900[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14900[label="",style="solid", color="blue", weight=9];
14900 -> 4908[label="",style="solid", color="blue", weight=3];
14901[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14901[label="",style="solid", color="blue", weight=9];
14901 -> 4909[label="",style="solid", color="blue", weight=3];
14902[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14902[label="",style="solid", color="blue", weight=9];
14902 -> 4910[label="",style="solid", color="blue", weight=3];
14903[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14903[label="",style="solid", color="blue", weight=9];
14903 -> 4911[label="",style="solid", color="blue", weight=3];
14904[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14904[label="",style="solid", color="blue", weight=9];
14904 -> 4912[label="",style="solid", color="blue", weight=3];
14905[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14905[label="",style="solid", color="blue", weight=9];
14905 -> 4913[label="",style="solid", color="blue", weight=3];
14906[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14906[label="",style="solid", color="blue", weight=9];
14906 -> 4914[label="",style="solid", color="blue", weight=3];
14907[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14907[label="",style="solid", color="blue", weight=9];
14907 -> 4915[label="",style="solid", color="blue", weight=3];
14908[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];4825 -> 14908[label="",style="solid", color="blue", weight=9];
14908 -> 4916[label="",style="solid", color="blue", weight=3];
4826[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu204))) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))))\n  Enum a",fontsize=16,color="black",shape="box"];4826 -> 4917[label="",style="solid", color="black", weight=3];
4827 -> 808[label="",style="dashed", color="red", weight=0];
4827[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];3130[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)))) ((>=) Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];3130 -> 3194[label="",style="solid", color="black", weight=3];
625 -> 6016[label="",style="dashed", color="red", weight=0];
625[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu8))) (Pos (primPlusNat (Succ xu9) Zero)) (iterate (primPlusInt (Pos (Succ xu9))) (primPlusInt (Pos (Succ xu9)) (Pos (primPlusNat (Succ xu9) Zero)))) (not (primCmpInt (Pos (primPlusNat (Succ xu9) Zero)) (Pos (Succ xu8)) == GT)))\n  Enum a",fontsize=16,color="magenta"];625 -> 6017[label="",style="dashed", color="magenta", weight=3];
625 -> 6018[label="",style="dashed", color="magenta", weight=3];
625 -> 6019[label="",style="dashed", color="magenta", weight=3];
625 -> 6020[label="",style="dashed", color="magenta", weight=3];
625 -> 6021[label="",style="dashed", color="magenta", weight=3];
5554[label="Zero",fontsize=16,color="green",shape="box"];5555[label="xu300",fontsize=16,color="green",shape="box"];5556[label="Succ xu300",fontsize=16,color="green",shape="box"];5553[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat xu228 xu229) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat xu228 xu229)) (primPlusInt (primMinusNat xu228 xu229) (primPlusInt (primMinusNat xu228 xu229) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat xu228 xu229) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14911[label="xu228/Succ xu2280",fontsize=10,color="white",style="solid",shape="box"];5553 -> 14911[label="",style="solid", color="burlywood", weight=9];
14911 -> 5587[label="",style="solid", color="burlywood", weight=3];
14912[label="xu228/Zero",fontsize=10,color="white",style="solid",shape="box"];5553 -> 14912[label="",style="solid", color="burlywood", weight=9];
14912 -> 5588[label="",style="solid", color="burlywood", weight=3];
6270 -> 5891[label="",style="dashed", color="red", weight=0];
6270[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];6270 -> 6299[label="",style="dashed", color="magenta", weight=3];
6270 -> 6300[label="",style="dashed", color="magenta", weight=3];
6271[label="xu6",fontsize=16,color="green",shape="box"];6272 -> 5891[label="",style="dashed", color="red", weight=0];
6272[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];6272 -> 6301[label="",style="dashed", color="magenta", weight=3];
6272 -> 6302[label="",style="dashed", color="magenta", weight=3];
6273 -> 5891[label="",style="dashed", color="red", weight=0];
6273[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];6273 -> 6303[label="",style="dashed", color="magenta", weight=3];
6273 -> 6304[label="",style="dashed", color="magenta", weight=3];
6269[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu249) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu250))) (not (primCmpInt (Pos xu251) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14916[label="xu251/Succ xu2510",fontsize=10,color="white",style="solid",shape="box"];6269 -> 14916[label="",style="solid", color="burlywood", weight=9];
14916 -> 6305[label="",style="solid", color="burlywood", weight=3];
14917[label="xu251/Zero",fontsize=10,color="white",style="solid",shape="box"];6269 -> 14917[label="",style="solid", color="burlywood", weight=9];
14917 -> 6306[label="",style="solid", color="burlywood", weight=3];
4907[label="xu197",fontsize=16,color="green",shape="box"];4710[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)))) (flip (<=) (Pos (Succ xu196)) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197))))\n  Enum a",fontsize=16,color="black",shape="box"];4710 -> 4776[label="",style="solid", color="black", weight=3];
4908[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4908 -> 14151[label="",style="solid", color="black", weight=3];
4909[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4909 -> 14152[label="",style="solid", color="black", weight=3];
4910[label="toEnum (Pos (Succ xu205))\n  Integral a",fontsize=16,color="black",shape="box"];4910 -> 14153[label="",style="solid", color="black", weight=3];
4911[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4911 -> 14154[label="",style="solid", color="black", weight=3];
4912[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4912 -> 14155[label="",style="solid", color="black", weight=3];
4913[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4913 -> 14156[label="",style="solid", color="black", weight=3];
4914[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4914 -> 14157[label="",style="solid", color="black", weight=3];
4915[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4915 -> 14158[label="",style="solid", color="black", weight=3];
4916[label="toEnum (Pos (Succ xu205))",fontsize=16,color="black",shape="box"];4916 -> 14159[label="",style="solid", color="black", weight=3];
4917[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205) : iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)))))\n  Enum a",fontsize=16,color="black",shape="box"];4917 -> 4979[label="",style="solid", color="black", weight=3];
3194[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)))) (compare (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];3194 -> 3236[label="",style="solid", color="black", weight=3];
6017[label="xu8",fontsize=16,color="green",shape="box"];6018[label="xu9",fontsize=16,color="green",shape="box"];6019 -> 5891[label="",style="dashed", color="red", weight=0];
6019[label="primPlusNat (Succ xu9) Zero",fontsize=16,color="magenta"];6019 -> 6064[label="",style="dashed", color="magenta", weight=3];
6019 -> 6065[label="",style="dashed", color="magenta", weight=3];
6020 -> 5891[label="",style="dashed", color="red", weight=0];
6020[label="primPlusNat (Succ xu9) Zero",fontsize=16,color="magenta"];6020 -> 6066[label="",style="dashed", color="magenta", weight=3];
6020 -> 6067[label="",style="dashed", color="magenta", weight=3];
6021 -> 5891[label="",style="dashed", color="red", weight=0];
6021[label="primPlusNat (Succ xu9) Zero",fontsize=16,color="magenta"];6021 -> 6068[label="",style="dashed", color="magenta", weight=3];
6021 -> 6069[label="",style="dashed", color="magenta", weight=3];
6016[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu240) (iterate (primPlusInt (Pos (Succ xu1980000))) (primPlusInt (Pos (Succ xu1980000)) (Pos xu241))) (not (primCmpInt (Pos xu242) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14921[label="xu242/Succ xu2420",fontsize=10,color="white",style="solid",shape="box"];6016 -> 14921[label="",style="solid", color="burlywood", weight=9];
14921 -> 6070[label="",style="solid", color="burlywood", weight=3];
14922[label="xu242/Zero",fontsize=10,color="white",style="solid",shape="box"];6016 -> 14922[label="",style="solid", color="burlywood", weight=9];
14922 -> 6071[label="",style="solid", color="burlywood", weight=3];
5587[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ xu2280) xu229) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat (Succ xu2280) xu229)) (primPlusInt (primMinusNat (Succ xu2280) xu229) (primPlusInt (primMinusNat (Succ xu2280) xu229) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2280) xu229) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14923[label="xu229/Succ xu2290",fontsize=10,color="white",style="solid",shape="box"];5587 -> 14923[label="",style="solid", color="burlywood", weight=9];
14923 -> 5603[label="",style="solid", color="burlywood", weight=3];
14924[label="xu229/Zero",fontsize=10,color="white",style="solid",shape="box"];5587 -> 14924[label="",style="solid", color="burlywood", weight=9];
14924 -> 5604[label="",style="solid", color="burlywood", weight=3];
5588[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero xu229) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat Zero xu229)) (primPlusInt (primMinusNat Zero xu229) (primPlusInt (primMinusNat Zero xu229) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat Zero xu229) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14925[label="xu229/Succ xu2290",fontsize=10,color="white",style="solid",shape="box"];5588 -> 14925[label="",style="solid", color="burlywood", weight=9];
14925 -> 5605[label="",style="solid", color="burlywood", weight=3];
14926[label="xu229/Zero",fontsize=10,color="white",style="solid",shape="box"];5588 -> 14926[label="",style="solid", color="burlywood", weight=9];
14926 -> 5606[label="",style="solid", color="burlywood", weight=3];
6299[label="Zero",fontsize=16,color="green",shape="box"];6300[label="Zero",fontsize=16,color="green",shape="box"];5891[label="primPlusNat xu2280 xu230",fontsize=16,color="burlywood",shape="triangle"];14927[label="xu2280/Succ xu22800",fontsize=10,color="white",style="solid",shape="box"];5891 -> 14927[label="",style="solid", color="burlywood", weight=9];
14927 -> 5958[label="",style="solid", color="burlywood", weight=3];
14928[label="xu2280/Zero",fontsize=10,color="white",style="solid",shape="box"];5891 -> 14928[label="",style="solid", color="burlywood", weight=9];
14928 -> 5959[label="",style="solid", color="burlywood", weight=3];
6301[label="Zero",fontsize=16,color="green",shape="box"];6302[label="Zero",fontsize=16,color="green",shape="box"];6303[label="Zero",fontsize=16,color="green",shape="box"];6304[label="Zero",fontsize=16,color="green",shape="box"];6305[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu249) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu250))) (not (primCmpInt (Pos (Succ xu2510)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];6305 -> 6417[label="",style="solid", color="black", weight=3];
6306[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu249) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu250))) (not (primCmpInt (Pos Zero) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];6306 -> 6418[label="",style="solid", color="black", weight=3];
4776[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)))) ((<=) Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197) Pos (Succ xu196)))\n  Enum a",fontsize=16,color="black",shape="box"];4776 -> 4891[label="",style="solid", color="black", weight=3];
14151[label="error []",fontsize=16,color="red",shape="box"];14152[label="error []",fontsize=16,color="red",shape="box"];14153[label="error []",fontsize=16,color="red",shape="box"];14154[label="error []",fontsize=16,color="red",shape="box"];14155[label="error []",fontsize=16,color="red",shape="box"];14156[label="error []",fontsize=16,color="red",shape="box"];14157[label="error []",fontsize=16,color="red",shape="box"];14158[label="error []",fontsize=16,color="red",shape="box"];14159 -> 10565[label="",style="dashed", color="red", weight=0];
14159[label="primIntToChar (Pos (Succ xu205))",fontsize=16,color="magenta"];14159 -> 14383[label="",style="dashed", color="magenta", weight=3];
4979[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205) : iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)))))\n  Enum a",fontsize=16,color="black",shape="box"];4979 -> 5051[label="",style="solid", color="black", weight=3];
3236[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)))) (not (compare (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3236 -> 3279[label="",style="solid", color="black", weight=3];
6064[label="Succ xu9",fontsize=16,color="green",shape="box"];6065[label="Zero",fontsize=16,color="green",shape="box"];6066[label="Succ xu9",fontsize=16,color="green",shape="box"];6067[label="Zero",fontsize=16,color="green",shape="box"];6068[label="Succ xu9",fontsize=16,color="green",shape="box"];6069[label="Zero",fontsize=16,color="green",shape="box"];6070[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu240) (iterate (primPlusInt (Pos (Succ xu1980000))) (primPlusInt (Pos (Succ xu1980000)) (Pos xu241))) (not (primCmpInt (Pos (Succ xu2420)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];6070 -> 6145[label="",style="solid", color="black", weight=3];
6071[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu240) (iterate (primPlusInt (Pos (Succ xu1980000))) (primPlusInt (Pos (Succ xu1980000)) (Pos xu241))) (not (primCmpInt (Pos Zero) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];6071 -> 6146[label="",style="solid", color="black", weight=3];
5603[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ xu2280) (Succ xu2290)) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat (Succ xu2280) (Succ xu2290))) (primPlusInt (primMinusNat (Succ xu2280) (Succ xu2290)) (primPlusInt (primMinusNat (Succ xu2280) (Succ xu2290)) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2280) (Succ xu2290)) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5603 -> 5627[label="",style="solid", color="black", weight=3];
5604[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ xu2280) Zero) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat (Succ xu2280) Zero)) (primPlusInt (primMinusNat (Succ xu2280) Zero) (primPlusInt (primMinusNat (Succ xu2280) Zero) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2280) Zero) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5604 -> 5628[label="",style="solid", color="black", weight=3];
5605[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero (Succ xu2290)) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat Zero (Succ xu2290))) (primPlusInt (primMinusNat Zero (Succ xu2290)) (primPlusInt (primMinusNat Zero (Succ xu2290)) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ xu2290)) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5605 -> 5629[label="",style="solid", color="black", weight=3];
5606[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5606 -> 5630[label="",style="solid", color="black", weight=3];
5958[label="primPlusNat (Succ xu22800) xu230",fontsize=16,color="burlywood",shape="box"];14930[label="xu230/Succ xu2300",fontsize=10,color="white",style="solid",shape="box"];5958 -> 14930[label="",style="solid", color="burlywood", weight=9];
14930 -> 5981[label="",style="solid", color="burlywood", weight=3];
14931[label="xu230/Zero",fontsize=10,color="white",style="solid",shape="box"];5958 -> 14931[label="",style="solid", color="burlywood", weight=9];
14931 -> 5982[label="",style="solid", color="burlywood", weight=3];
5959[label="primPlusNat Zero xu230",fontsize=16,color="burlywood",shape="box"];14932[label="xu230/Succ xu2300",fontsize=10,color="white",style="solid",shape="box"];5959 -> 14932[label="",style="solid", color="burlywood", weight=9];
14932 -> 5983[label="",style="solid", color="burlywood", weight=3];
14933[label="xu230/Zero",fontsize=10,color="white",style="solid",shape="box"];5959 -> 14933[label="",style="solid", color="burlywood", weight=9];
14933 -> 5984[label="",style="solid", color="burlywood", weight=3];
6417 -> 9466[label="",style="dashed", color="red", weight=0];
6417[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu249) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu250))) (not (primCmpNat (Succ xu2510) (Succ xu196) == GT)))\n  Enum a",fontsize=16,color="magenta"];6417 -> 9467[label="",style="dashed", color="magenta", weight=3];
6417 -> 9468[label="",style="dashed", color="magenta", weight=3];
6417 -> 9469[label="",style="dashed", color="magenta", weight=3];
6417 -> 9470[label="",style="dashed", color="magenta", weight=3];
6417 -> 9471[label="",style="dashed", color="magenta", weight=3];
6418 -> 9466[label="",style="dashed", color="red", weight=0];
6418[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu249) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu250))) (not (primCmpNat Zero (Succ xu196) == GT)))\n  Enum a",fontsize=16,color="magenta"];6418 -> 9472[label="",style="dashed", color="magenta", weight=3];
6418 -> 9473[label="",style="dashed", color="magenta", weight=3];
6418 -> 9474[label="",style="dashed", color="magenta", weight=3];
6418 -> 9475[label="",style="dashed", color="magenta", weight=3];
6418 -> 9476[label="",style="dashed", color="magenta", weight=3];
4891[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)))) (compare (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (Pos (Succ xu196)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];4891 -> 4918[label="",style="solid", color="black", weight=3];
14383[label="Pos (Succ xu205)",fontsize=16,color="green",shape="box"];10565[label="primIntToChar xu315",fontsize=16,color="burlywood",shape="triangle"];14936[label="xu315/Pos xu3150",fontsize=10,color="white",style="solid",shape="box"];10565 -> 14936[label="",style="solid", color="burlywood", weight=9];
14936 -> 10606[label="",style="solid", color="burlywood", weight=3];
14937[label="xu315/Neg xu3150",fontsize=10,color="white",style="solid",shape="box"];10565 -> 14937[label="",style="solid", color="burlywood", weight=9];
14937 -> 10607[label="",style="solid", color="burlywood", weight=3];
5051[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)))) (flip (>=) (Pos (Succ xu204)) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205))))\n  Enum a",fontsize=16,color="black",shape="box"];5051 -> 5084[label="",style="solid", color="black", weight=3];
3279[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (iterate (Pos (Succ xu139) - Pos (Succ xu140) +) (Pos (Succ xu139) - Pos (Succ xu140) + (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)))) (not (primCmpInt (Pos (Succ xu139) - Pos (Succ xu140) + Pos (Succ xu140)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3279 -> 3352[label="",style="solid", color="black", weight=3];
6145 -> 9361[label="",style="dashed", color="red", weight=0];
6145[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu240) (iterate (primPlusInt (Pos (Succ xu1980000))) (primPlusInt (Pos (Succ xu1980000)) (Pos xu241))) (not (primCmpNat (Succ xu2420) (Succ xu196) == GT)))\n  Enum a",fontsize=16,color="magenta"];6145 -> 9362[label="",style="dashed", color="magenta", weight=3];
6145 -> 9363[label="",style="dashed", color="magenta", weight=3];
6145 -> 9364[label="",style="dashed", color="magenta", weight=3];
6145 -> 9365[label="",style="dashed", color="magenta", weight=3];
6145 -> 9366[label="",style="dashed", color="magenta", weight=3];
6145 -> 9367[label="",style="dashed", color="magenta", weight=3];
6146 -> 9361[label="",style="dashed", color="red", weight=0];
6146[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos xu240) (iterate (primPlusInt (Pos (Succ xu1980000))) (primPlusInt (Pos (Succ xu1980000)) (Pos xu241))) (not (primCmpNat Zero (Succ xu196) == GT)))\n  Enum a",fontsize=16,color="magenta"];6146 -> 9368[label="",style="dashed", color="magenta", weight=3];
6146 -> 9369[label="",style="dashed", color="magenta", weight=3];
6146 -> 9370[label="",style="dashed", color="magenta", weight=3];
6146 -> 9371[label="",style="dashed", color="magenta", weight=3];
6146 -> 9372[label="",style="dashed", color="magenta", weight=3];
6146 -> 9373[label="",style="dashed", color="magenta", weight=3];
5627 -> 5553[label="",style="dashed", color="red", weight=0];
5627[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat xu2280 xu2290) (Pos (Succ xu230))) (iterate (primPlusInt (primMinusNat xu2280 xu2290)) (primPlusInt (primMinusNat xu2280 xu2290) (primPlusInt (primMinusNat xu2280 xu2290) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (primMinusNat xu2280 xu2290) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];5627 -> 5669[label="",style="dashed", color="magenta", weight=3];
5627 -> 5670[label="",style="dashed", color="magenta", weight=3];
5628[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu2280)) (Pos (Succ xu230))) (iterate (primPlusInt (Pos (Succ xu2280))) (primPlusInt (Pos (Succ xu2280)) (primPlusInt (Pos (Succ xu2280)) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (Pos (Succ xu2280)) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];5628 -> 5671[label="",style="solid", color="black", weight=3];
5629[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu2290)) (Pos (Succ xu230))) (iterate (primPlusInt (Neg (Succ xu2290))) (primPlusInt (Neg (Succ xu2290)) (primPlusInt (Neg (Succ xu2290)) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (Neg (Succ xu2290)) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];5629 -> 5672[label="",style="solid", color="black", weight=3];
5630[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];5630 -> 5673[label="",style="solid", color="black", weight=3];
5981[label="primPlusNat (Succ xu22800) (Succ xu2300)",fontsize=16,color="black",shape="box"];5981 -> 6082[label="",style="solid", color="black", weight=3];
5982[label="primPlusNat (Succ xu22800) Zero",fontsize=16,color="black",shape="box"];5982 -> 6083[label="",style="solid", color="black", weight=3];
5983[label="primPlusNat Zero (Succ xu2300)",fontsize=16,color="black",shape="box"];5983 -> 6084[label="",style="solid", color="black", weight=3];
5984[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];5984 -> 6085[label="",style="solid", color="black", weight=3];
9467[label="xu249",fontsize=16,color="green",shape="box"];9468[label="Succ xu196",fontsize=16,color="green",shape="box"];9469[label="Succ xu2510",fontsize=16,color="green",shape="box"];9470[label="xu196",fontsize=16,color="green",shape="box"];9471[label="xu250",fontsize=16,color="green",shape="box"];9466[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat xu311 xu312 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14941[label="xu311/Succ xu3110",fontsize=10,color="white",style="solid",shape="box"];9466 -> 14941[label="",style="solid", color="burlywood", weight=9];
14941 -> 9522[label="",style="solid", color="burlywood", weight=3];
14942[label="xu311/Zero",fontsize=10,color="white",style="solid",shape="box"];9466 -> 14942[label="",style="solid", color="burlywood", weight=9];
14942 -> 9523[label="",style="solid", color="burlywood", weight=3];
9472[label="xu249",fontsize=16,color="green",shape="box"];9473[label="Succ xu196",fontsize=16,color="green",shape="box"];9474[label="Zero",fontsize=16,color="green",shape="box"];9475[label="xu196",fontsize=16,color="green",shape="box"];9476[label="xu250",fontsize=16,color="green",shape="box"];4918[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)))) (not (compare (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4918 -> 4980[label="",style="solid", color="black", weight=3];
10606[label="primIntToChar (Pos xu3150)",fontsize=16,color="black",shape="box"];10606 -> 10754[label="",style="solid", color="black", weight=3];
10607[label="primIntToChar (Neg xu3150)",fontsize=16,color="burlywood",shape="box"];14943[label="xu3150/Succ xu31500",fontsize=10,color="white",style="solid",shape="box"];10607 -> 14943[label="",style="solid", color="burlywood", weight=9];
14943 -> 10755[label="",style="solid", color="burlywood", weight=3];
14944[label="xu3150/Zero",fontsize=10,color="white",style="solid",shape="box"];10607 -> 14944[label="",style="solid", color="burlywood", weight=9];
14944 -> 10756[label="",style="solid", color="burlywood", weight=3];
5084[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)))) ((>=) Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205) Pos (Succ xu204)))\n  Enum a",fontsize=16,color="black",shape="box"];5084 -> 5140[label="",style="solid", color="black", weight=3];
3352[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu139) - Pos (Succ xu140)) (Pos (Succ xu140))) (iterate (primPlusInt (Pos (Succ xu139) - Pos (Succ xu140))) (primPlusInt (Pos (Succ xu139) - Pos (Succ xu140)) (primPlusInt (Pos (Succ xu139) - Pos (Succ xu140)) (Pos (Succ xu140))))) (not (primCmpInt (primPlusInt (Pos (Succ xu139) - Pos (Succ xu140)) (Pos (Succ xu140))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3352 -> 3420[label="",style="solid", color="black", weight=3];
9362[label="xu1980000",fontsize=16,color="green",shape="box"];9363[label="xu241",fontsize=16,color="green",shape="box"];9364[label="Succ xu196",fontsize=16,color="green",shape="box"];9365[label="xu196",fontsize=16,color="green",shape="box"];9366[label="Succ xu2420",fontsize=16,color="green",shape="box"];9367[label="xu240",fontsize=16,color="green",shape="box"];9361[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat xu305 xu306 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14945[label="xu305/Succ xu3050",fontsize=10,color="white",style="solid",shape="box"];9361 -> 14945[label="",style="solid", color="burlywood", weight=9];
14945 -> 9428[label="",style="solid", color="burlywood", weight=3];
14946[label="xu305/Zero",fontsize=10,color="white",style="solid",shape="box"];9361 -> 14946[label="",style="solid", color="burlywood", weight=9];
14946 -> 9429[label="",style="solid", color="burlywood", weight=3];
9368[label="xu1980000",fontsize=16,color="green",shape="box"];9369[label="xu241",fontsize=16,color="green",shape="box"];9370[label="Succ xu196",fontsize=16,color="green",shape="box"];9371[label="xu196",fontsize=16,color="green",shape="box"];9372[label="Zero",fontsize=16,color="green",shape="box"];9373[label="xu240",fontsize=16,color="green",shape="box"];5669[label="xu2280",fontsize=16,color="green",shape="box"];5670[label="xu2290",fontsize=16,color="green",shape="box"];5671[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (primPlusNat (Succ xu2280) (Succ xu230))) (iterate (primPlusInt (Pos (Succ xu2280))) (primPlusInt (Pos (Succ xu2280)) (Pos (primPlusNat (Succ xu2280) (Succ xu230))))) (not (primCmpInt (Pos (primPlusNat (Succ xu2280) (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5671 -> 5718[label="",style="solid", color="black", weight=3];
5672 -> 8716[label="",style="dashed", color="red", weight=0];
5672[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ xu230) (Succ xu2290)) (iterate (primPlusInt (Neg (Succ xu2290))) (primPlusInt (Neg (Succ xu2290)) (primMinusNat (Succ xu230) (Succ xu2290)))) (not (primCmpInt (primMinusNat (Succ xu230) (Succ xu2290)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];5672 -> 8717[label="",style="dashed", color="magenta", weight=3];
5672 -> 8718[label="",style="dashed", color="magenta", weight=3];
5672 -> 8719[label="",style="dashed", color="magenta", weight=3];
5673[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (primPlusNat Zero (Succ xu230))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero (Succ xu230))))) (not (primCmpInt (Pos (primPlusNat Zero (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5673 -> 5720[label="",style="solid", color="black", weight=3];
6082[label="Succ (Succ (primPlusNat xu22800 xu2300))",fontsize=16,color="green",shape="box"];6082 -> 6147[label="",style="dashed", color="green", weight=3];
6083[label="Succ xu22800",fontsize=16,color="green",shape="box"];6084[label="Succ xu2300",fontsize=16,color="green",shape="box"];6085[label="Zero",fontsize=16,color="green",shape="box"];9522[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat (Succ xu3110) xu312 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14948[label="xu312/Succ xu3120",fontsize=10,color="white",style="solid",shape="box"];9522 -> 14948[label="",style="solid", color="burlywood", weight=9];
14948 -> 9583[label="",style="solid", color="burlywood", weight=3];
14949[label="xu312/Zero",fontsize=10,color="white",style="solid",shape="box"];9522 -> 14949[label="",style="solid", color="burlywood", weight=9];
14949 -> 9584[label="",style="solid", color="burlywood", weight=3];
9523[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat Zero xu312 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14950[label="xu312/Succ xu3120",fontsize=10,color="white",style="solid",shape="box"];9523 -> 14950[label="",style="solid", color="burlywood", weight=9];
14950 -> 9585[label="",style="solid", color="burlywood", weight=3];
14951[label="xu312/Zero",fontsize=10,color="white",style="solid",shape="box"];9523 -> 14951[label="",style="solid", color="burlywood", weight=9];
14951 -> 9586[label="",style="solid", color="burlywood", weight=3];
4980[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (iterate (Pos (Succ xu198) - Pos (Succ xu197) +) (Pos (Succ xu198) - Pos (Succ xu197) + (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)))) (not (primCmpInt (Pos (Succ xu198) - Pos (Succ xu197) + Pos (Succ xu197)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4980 -> 5052[label="",style="solid", color="black", weight=3];
10754[label="Char xu3150",fontsize=16,color="green",shape="box"];10755[label="primIntToChar (Neg (Succ xu31500))",fontsize=16,color="black",shape="box"];10755 -> 10973[label="",style="solid", color="black", weight=3];
10756[label="primIntToChar (Neg Zero)",fontsize=16,color="black",shape="box"];10756 -> 10974[label="",style="solid", color="black", weight=3];
5140[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)))) (compare (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (Pos (Succ xu204)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];5140 -> 5221[label="",style="solid", color="black", weight=3];
3420[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusInt (Pos (Succ xu139)) (Pos (Succ xu140))) (Pos (Succ xu140))) (iterate (primPlusInt (primMinusInt (Pos (Succ xu139)) (Pos (Succ xu140)))) (primPlusInt (primMinusInt (Pos (Succ xu139)) (Pos (Succ xu140))) (primPlusInt (primMinusInt (Pos (Succ xu139)) (Pos (Succ xu140))) (Pos (Succ xu140))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ xu139)) (Pos (Succ xu140))) (Pos (Succ xu140))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3420 -> 3456[label="",style="solid", color="black", weight=3];
9428[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat (Succ xu3050) xu306 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14952[label="xu306/Succ xu3060",fontsize=10,color="white",style="solid",shape="box"];9428 -> 14952[label="",style="solid", color="burlywood", weight=9];
14952 -> 9524[label="",style="solid", color="burlywood", weight=3];
14953[label="xu306/Zero",fontsize=10,color="white",style="solid",shape="box"];9428 -> 14953[label="",style="solid", color="burlywood", weight=9];
14953 -> 9525[label="",style="solid", color="burlywood", weight=3];
9429[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat Zero xu306 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14954[label="xu306/Succ xu3060",fontsize=10,color="white",style="solid",shape="box"];9429 -> 14954[label="",style="solid", color="burlywood", weight=9];
14954 -> 9526[label="",style="solid", color="burlywood", weight=3];
14955[label="xu306/Zero",fontsize=10,color="white",style="solid",shape="box"];9429 -> 14955[label="",style="solid", color="burlywood", weight=9];
14955 -> 9527[label="",style="solid", color="burlywood", weight=3];
5718[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))) (iterate (primPlusInt (Pos (Succ xu2280))) (primPlusInt (Pos (Succ xu2280)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))))) (not (primCmpInt (Pos (Succ (Succ (primPlusNat xu2280 xu230)))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5718 -> 5748[label="",style="solid", color="black", weight=3];
8717[label="xu2290",fontsize=16,color="green",shape="box"];8718[label="Succ xu230",fontsize=16,color="green",shape="box"];8719[label="Succ xu2290",fontsize=16,color="green",shape="box"];8716[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat xu278 xu279) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat xu278 xu279))) (not (primCmpInt (primMinusNat xu278 xu279) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14956[label="xu278/Succ xu2780",fontsize=10,color="white",style="solid",shape="box"];8716 -> 14956[label="",style="solid", color="burlywood", weight=9];
14956 -> 8756[label="",style="solid", color="burlywood", weight=3];
14957[label="xu278/Zero",fontsize=10,color="white",style="solid",shape="box"];8716 -> 14957[label="",style="solid", color="burlywood", weight=9];
14957 -> 8757[label="",style="solid", color="burlywood", weight=3];
5720[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu230)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))) (not (primCmpInt (Pos (Succ xu230)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5720 -> 5751[label="",style="solid", color="black", weight=3];
6147 -> 5891[label="",style="dashed", color="red", weight=0];
6147[label="primPlusNat xu22800 xu2300",fontsize=16,color="magenta"];6147 -> 6211[label="",style="dashed", color="magenta", weight=3];
6147 -> 6212[label="",style="dashed", color="magenta", weight=3];
9583[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat (Succ xu3110) (Succ xu3120) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9583 -> 9658[label="",style="solid", color="black", weight=3];
9584[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat (Succ xu3110) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9584 -> 9659[label="",style="solid", color="black", weight=3];
9585[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat Zero (Succ xu3120) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9585 -> 9660[label="",style="solid", color="black", weight=3];
9586[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9586 -> 9661[label="",style="solid", color="black", weight=3];
5052[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (primPlusInt (Pos (Succ xu198) - Pos (Succ xu197)) (Pos (Succ xu197))) (iterate (primPlusInt (Pos (Succ xu198) - Pos (Succ xu197))) (primPlusInt (Pos (Succ xu198) - Pos (Succ xu197)) (primPlusInt (Pos (Succ xu198) - Pos (Succ xu197)) (Pos (Succ xu197))))) (not (primCmpInt (primPlusInt (Pos (Succ xu198) - Pos (Succ xu197)) (Pos (Succ xu197))) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];5052 -> 5085[label="",style="solid", color="black", weight=3];
10973[label="error []",fontsize=16,color="red",shape="box"];10974[label="Char Zero",fontsize=16,color="green",shape="box"];5221[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)))) (not (compare (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (Pos (Succ xu204)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5221 -> 5290[label="",style="solid", color="black", weight=3];
3456 -> 5553[label="",style="dashed", color="red", weight=0];
3456[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ xu139) (Succ xu140)) (Pos (Succ xu140))) (iterate (primPlusInt (primMinusNat (Succ xu139) (Succ xu140))) (primPlusInt (primMinusNat (Succ xu139) (Succ xu140)) (primPlusInt (primMinusNat (Succ xu139) (Succ xu140)) (Pos (Succ xu140))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu139) (Succ xu140)) (Pos (Succ xu140))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];3456 -> 5557[label="",style="dashed", color="magenta", weight=3];
3456 -> 5558[label="",style="dashed", color="magenta", weight=3];
3456 -> 5559[label="",style="dashed", color="magenta", weight=3];
9524[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat (Succ xu3050) (Succ xu3060) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9524 -> 9587[label="",style="solid", color="black", weight=3];
9525[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat (Succ xu3050) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9525 -> 9588[label="",style="solid", color="black", weight=3];
9526[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat Zero (Succ xu3060) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9526 -> 9589[label="",style="solid", color="black", weight=3];
9527[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9527 -> 9590[label="",style="solid", color="black", weight=3];
5748[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))) (iterate (primPlusInt (Pos (Succ xu2280))) (primPlusInt (Pos (Succ xu2280)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))))) (not (primCmpNat (Succ (Succ (primPlusNat xu2280 xu230))) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5748 -> 5785[label="",style="solid", color="black", weight=3];
8756[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ xu2780) xu279) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat (Succ xu2780) xu279))) (not (primCmpInt (primMinusNat (Succ xu2780) xu279) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14960[label="xu279/Succ xu2790",fontsize=10,color="white",style="solid",shape="box"];8756 -> 14960[label="",style="solid", color="burlywood", weight=9];
14960 -> 8917[label="",style="solid", color="burlywood", weight=3];
14961[label="xu279/Zero",fontsize=10,color="white",style="solid",shape="box"];8756 -> 14961[label="",style="solid", color="burlywood", weight=9];
14961 -> 8918[label="",style="solid", color="burlywood", weight=3];
8757[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero xu279) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat Zero xu279))) (not (primCmpInt (primMinusNat Zero xu279) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14962[label="xu279/Succ xu2790",fontsize=10,color="white",style="solid",shape="box"];8757 -> 14962[label="",style="solid", color="burlywood", weight=9];
14962 -> 8919[label="",style="solid", color="burlywood", weight=3];
14963[label="xu279/Zero",fontsize=10,color="white",style="solid",shape="box"];8757 -> 14963[label="",style="solid", color="burlywood", weight=9];
14963 -> 8920[label="",style="solid", color="burlywood", weight=3];
5751[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu230)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))) (not (primCmpNat (Succ xu230) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5751 -> 5790[label="",style="solid", color="black", weight=3];
6211[label="xu22800",fontsize=16,color="green",shape="box"];6212[label="xu2300",fontsize=16,color="green",shape="box"];9658 -> 9466[label="",style="dashed", color="red", weight=0];
9658[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (primCmpNat xu3110 xu3120 == GT)))\n  Enum a",fontsize=16,color="magenta"];9658 -> 9730[label="",style="dashed", color="magenta", weight=3];
9658 -> 9731[label="",style="dashed", color="magenta", weight=3];
9659[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9659 -> 9732[label="",style="solid", color="black", weight=3];
9660[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9660 -> 9733[label="",style="solid", color="black", weight=3];
9661[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9661 -> 9734[label="",style="solid", color="black", weight=3];
5085[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (primPlusInt (primMinusInt (Pos (Succ xu198)) (Pos (Succ xu197))) (Pos (Succ xu197))) (iterate (primPlusInt (primMinusInt (Pos (Succ xu198)) (Pos (Succ xu197)))) (primPlusInt (primMinusInt (Pos (Succ xu198)) (Pos (Succ xu197))) (primPlusInt (primMinusInt (Pos (Succ xu198)) (Pos (Succ xu197))) (Pos (Succ xu197))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ xu198)) (Pos (Succ xu197))) (Pos (Succ xu197))) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];5085 -> 5141[label="",style="solid", color="black", weight=3];
5290[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (iterate (Pos (Succ xu206) - Pos (Succ xu205) +) (Pos (Succ xu206) - Pos (Succ xu205) + (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)))) (not (primCmpInt (Pos (Succ xu206) - Pos (Succ xu205) + Pos (Succ xu205)) (Pos (Succ xu204)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5290 -> 5359[label="",style="solid", color="black", weight=3];
5557[label="Succ xu139",fontsize=16,color="green",shape="box"];5558[label="xu140",fontsize=16,color="green",shape="box"];5559[label="Succ xu140",fontsize=16,color="green",shape="box"];9587 -> 9361[label="",style="dashed", color="red", weight=0];
9587[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (primCmpNat xu3050 xu3060 == GT)))\n  Enum a",fontsize=16,color="magenta"];9587 -> 9662[label="",style="dashed", color="magenta", weight=3];
9587 -> 9663[label="",style="dashed", color="magenta", weight=3];
9588[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9588 -> 9664[label="",style="solid", color="black", weight=3];
9589[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9589 -> 9665[label="",style="solid", color="black", weight=3];
9590[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];9590 -> 9666[label="",style="solid", color="black", weight=3];
5785[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))) (iterate (primPlusInt (Pos (Succ xu2280))) (primPlusInt (Pos (Succ xu2280)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5785 -> 5830[label="",style="solid", color="black", weight=3];
8917[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ xu2780) (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat (Succ xu2780) (Succ xu2790)))) (not (primCmpInt (primMinusNat (Succ xu2780) (Succ xu2790)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];8917 -> 9019[label="",style="solid", color="black", weight=3];
8918[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ xu2780) Zero) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat (Succ xu2780) Zero))) (not (primCmpInt (primMinusNat (Succ xu2780) Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];8918 -> 9020[label="",style="solid", color="black", weight=3];
8919[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat Zero (Succ xu2790)))) (not (primCmpInt (primMinusNat Zero (Succ xu2790)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];8919 -> 9021[label="",style="solid", color="black", weight=3];
8920[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero Zero) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat Zero Zero))) (not (primCmpInt (primMinusNat Zero Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];8920 -> 9022[label="",style="solid", color="black", weight=3];
5790[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu230)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5790 -> 5835[label="",style="solid", color="black", weight=3];
9730[label="xu3120",fontsize=16,color="green",shape="box"];9731[label="xu3110",fontsize=16,color="green",shape="box"];9732[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];9732 -> 9816[label="",style="solid", color="black", weight=3];
9733[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];9733 -> 9817[label="",style="solid", color="black", weight=3];
9734 -> 9733[label="",style="dashed", color="red", weight=0];
9734[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) (not False))\n  Enum a",fontsize=16,color="magenta"];5141 -> 8466[label="",style="dashed", color="red", weight=0];
5141[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (primPlusInt (primMinusNat (Succ xu198) (Succ xu197)) (Pos (Succ xu197))) (iterate (primPlusInt (primMinusNat (Succ xu198) (Succ xu197))) (primPlusInt (primMinusNat (Succ xu198) (Succ xu197)) (primPlusInt (primMinusNat (Succ xu198) (Succ xu197)) (Pos (Succ xu197))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu198) (Succ xu197)) (Pos (Succ xu197))) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="magenta"];5141 -> 8467[label="",style="dashed", color="magenta", weight=3];
5141 -> 8468[label="",style="dashed", color="magenta", weight=3];
5141 -> 8469[label="",style="dashed", color="magenta", weight=3];
5141 -> 8470[label="",style="dashed", color="magenta", weight=3];
5359[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (primPlusInt (Pos (Succ xu206) - Pos (Succ xu205)) (Pos (Succ xu205))) (iterate (primPlusInt (Pos (Succ xu206) - Pos (Succ xu205))) (primPlusInt (Pos (Succ xu206) - Pos (Succ xu205)) (primPlusInt (Pos (Succ xu206) - Pos (Succ xu205)) (Pos (Succ xu205))))) (not (primCmpInt (primPlusInt (Pos (Succ xu206) - Pos (Succ xu205)) (Pos (Succ xu205))) (Pos (Succ xu204)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5359 -> 5439[label="",style="solid", color="black", weight=3];
9662[label="xu3060",fontsize=16,color="green",shape="box"];9663[label="xu3050",fontsize=16,color="green",shape="box"];9664[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];9664 -> 9735[label="",style="solid", color="black", weight=3];
9665[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];9665 -> 9736[label="",style="solid", color="black", weight=3];
9666 -> 9665[label="",style="dashed", color="red", weight=0];
9666[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) (not False))\n  Enum a",fontsize=16,color="magenta"];5830 -> 5882[label="",style="dashed", color="red", weight=0];
5830[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))) (iterate (primPlusInt (Pos (Succ xu2280))) (primPlusInt (Pos (Succ xu2280)) (Pos (Succ (Succ (primPlusNat xu2280 xu230)))))) (not False))\n  Enum a",fontsize=16,color="magenta"];5830 -> 5883[label="",style="dashed", color="magenta", weight=3];
5830 -> 5884[label="",style="dashed", color="magenta", weight=3];
9019 -> 8716[label="",style="dashed", color="red", weight=0];
9019[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat xu2780 xu2790) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat xu2780 xu2790))) (not (primCmpInt (primMinusNat xu2780 xu2790) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];9019 -> 9038[label="",style="dashed", color="magenta", weight=3];
9019 -> 9039[label="",style="dashed", color="magenta", weight=3];
9020[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu2780)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))) (not (primCmpInt (Pos (Succ xu2780)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9020 -> 9040[label="",style="solid", color="black", weight=3];
9021[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Neg (Succ xu2790)))) (not (primCmpInt (Neg (Succ xu2790)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9021 -> 9041[label="",style="solid", color="black", weight=3];
9022[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9022 -> 9042[label="",style="solid", color="black", weight=3];
5835[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu230)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];5835 -> 5890[label="",style="solid", color="black", weight=3];
9816[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) False)\n  Enum a",fontsize=16,color="black",shape="box"];9816 -> 9923[label="",style="solid", color="black", weight=3];
9817[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) True)\n  Enum a",fontsize=16,color="black",shape="box"];9817 -> 9924[label="",style="solid", color="black", weight=3];
8467[label="xu197",fontsize=16,color="green",shape="box"];8468[label="Succ xu197",fontsize=16,color="green",shape="box"];8469[label="xu196",fontsize=16,color="green",shape="box"];8470[label="Succ xu198",fontsize=16,color="green",shape="box"];8466[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat xu274 xu275) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat xu274 xu275)) (primPlusInt (primMinusNat xu274 xu275) (primPlusInt (primMinusNat xu274 xu275) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat xu274 xu275) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14971[label="xu274/Succ xu2740",fontsize=10,color="white",style="solid",shape="box"];8466 -> 14971[label="",style="solid", color="burlywood", weight=9];
14971 -> 8507[label="",style="solid", color="burlywood", weight=3];
14972[label="xu274/Zero",fontsize=10,color="white",style="solid",shape="box"];8466 -> 14972[label="",style="solid", color="burlywood", weight=9];
14972 -> 8508[label="",style="solid", color="burlywood", weight=3];
5439[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (primPlusInt (primMinusInt (Pos (Succ xu206)) (Pos (Succ xu205))) (Pos (Succ xu205))) (iterate (primPlusInt (primMinusInt (Pos (Succ xu206)) (Pos (Succ xu205)))) (primPlusInt (primMinusInt (Pos (Succ xu206)) (Pos (Succ xu205))) (primPlusInt (primMinusInt (Pos (Succ xu206)) (Pos (Succ xu205))) (Pos (Succ xu205))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ xu206)) (Pos (Succ xu205))) (Pos (Succ xu205))) (Pos (Succ xu204)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5439 -> 5523[label="",style="solid", color="black", weight=3];
9735[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) False)\n  Enum a",fontsize=16,color="black",shape="box"];9735 -> 9818[label="",style="solid", color="black", weight=3];
9736[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) True)\n  Enum a",fontsize=16,color="black",shape="box"];9736 -> 9819[label="",style="solid", color="black", weight=3];
5883[label="xu2280",fontsize=16,color="green",shape="box"];5884[label="Succ (primPlusNat xu2280 xu230)",fontsize=16,color="green",shape="box"];5884 -> 5891[label="",style="dashed", color="green", weight=3];
5882[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu235)) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];5882 -> 5892[label="",style="solid", color="black", weight=3];
9038[label="xu2780",fontsize=16,color="green",shape="box"];9039[label="xu2790",fontsize=16,color="green",shape="box"];9040[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu2780)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))) (not (primCmpNat (Succ xu2780) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9040 -> 9063[label="",style="solid", color="black", weight=3];
9041[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Neg (Succ xu2790)))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9041 -> 9064[label="",style="solid", color="black", weight=3];
9042[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos Zero))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9042 -> 9065[label="",style="solid", color="black", weight=3];
5890[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu230)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];5890 -> 5957[label="",style="solid", color="black", weight=3];
9923[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];9923 -> 10044[label="",style="solid", color="black", weight=3];
9924[label="map toEnum (Pos xu309 : takeWhile (flip (<=) (Pos (Succ xu308))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))))\n  Enum a",fontsize=16,color="black",shape="box"];9924 -> 10045[label="",style="solid", color="black", weight=3];
8507[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat (Succ xu2740) xu275) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat (Succ xu2740) xu275)) (primPlusInt (primMinusNat (Succ xu2740) xu275) (primPlusInt (primMinusNat (Succ xu2740) xu275) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2740) xu275) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14973[label="xu275/Succ xu2750",fontsize=10,color="white",style="solid",shape="box"];8507 -> 14973[label="",style="solid", color="burlywood", weight=9];
14973 -> 8697[label="",style="solid", color="burlywood", weight=3];
14974[label="xu275/Zero",fontsize=10,color="white",style="solid",shape="box"];8507 -> 14974[label="",style="solid", color="burlywood", weight=9];
14974 -> 8698[label="",style="solid", color="burlywood", weight=3];
8508[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat Zero xu275) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat Zero xu275)) (primPlusInt (primMinusNat Zero xu275) (primPlusInt (primMinusNat Zero xu275) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat Zero xu275) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14975[label="xu275/Succ xu2750",fontsize=10,color="white",style="solid",shape="box"];8508 -> 14975[label="",style="solid", color="burlywood", weight=9];
14975 -> 8699[label="",style="solid", color="burlywood", weight=3];
14976[label="xu275/Zero",fontsize=10,color="white",style="solid",shape="box"];8508 -> 14976[label="",style="solid", color="burlywood", weight=9];
14976 -> 8700[label="",style="solid", color="burlywood", weight=3];
5523 -> 8978[label="",style="dashed", color="red", weight=0];
5523[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu204))) (primPlusInt (primMinusNat (Succ xu206) (Succ xu205)) (Pos (Succ xu205))) (iterate (primPlusInt (primMinusNat (Succ xu206) (Succ xu205))) (primPlusInt (primMinusNat (Succ xu206) (Succ xu205)) (primPlusInt (primMinusNat (Succ xu206) (Succ xu205)) (Pos (Succ xu205))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu206) (Succ xu205)) (Pos (Succ xu205))) (Pos (Succ xu204)) == LT)))\n  Enum a",fontsize=16,color="magenta"];5523 -> 8979[label="",style="dashed", color="magenta", weight=3];
5523 -> 8980[label="",style="dashed", color="magenta", weight=3];
5523 -> 8981[label="",style="dashed", color="magenta", weight=3];
5523 -> 8982[label="",style="dashed", color="magenta", weight=3];
9818[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];9818 -> 9925[label="",style="solid", color="black", weight=3];
9819[label="map toEnum (Pos xu302 : takeWhile (flip (<=) (Pos (Succ xu301))) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))))\n  Enum a",fontsize=16,color="black",shape="box"];9819 -> 9926[label="",style="solid", color="black", weight=3];
5892[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu235)) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];5892 -> 5960[label="",style="solid", color="black", weight=3];
9063[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu2780)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9063 -> 9084[label="",style="solid", color="black", weight=3];
9064[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Neg (Succ xu2790)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];9064 -> 9085[label="",style="solid", color="black", weight=3];
9065[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos Zero))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];9065 -> 9086[label="",style="solid", color="black", weight=3];
5957[label="map toEnum (Pos (Succ xu230) : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))))\n  Enum a",fontsize=16,color="black",shape="box"];5957 -> 5980[label="",style="solid", color="black", weight=3];
10044[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu308))) (Pos xu309) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))) True)\n  Enum a",fontsize=16,color="black",shape="box"];10044 -> 10173[label="",style="solid", color="black", weight=3];
10045[label="toEnum (Pos xu309) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu308))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))))\n  Enum a",fontsize=16,color="green",shape="box"];10045 -> 10174[label="",style="dashed", color="green", weight=3];
10045 -> 10175[label="",style="dashed", color="green", weight=3];
8697[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat (Succ xu2740) (Succ xu2750)) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat (Succ xu2740) (Succ xu2750))) (primPlusInt (primMinusNat (Succ xu2740) (Succ xu2750)) (primPlusInt (primMinusNat (Succ xu2740) (Succ xu2750)) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2740) (Succ xu2750)) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];8697 -> 8758[label="",style="solid", color="black", weight=3];
8698[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat (Succ xu2740) Zero) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat (Succ xu2740) Zero)) (primPlusInt (primMinusNat (Succ xu2740) Zero) (primPlusInt (primMinusNat (Succ xu2740) Zero) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2740) Zero) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];8698 -> 8759[label="",style="solid", color="black", weight=3];
8699[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat Zero (Succ xu2750)) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat Zero (Succ xu2750))) (primPlusInt (primMinusNat Zero (Succ xu2750)) (primPlusInt (primMinusNat Zero (Succ xu2750)) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ xu2750)) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];8699 -> 8760[label="",style="solid", color="black", weight=3];
8700[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];8700 -> 8761[label="",style="solid", color="black", weight=3];
8979[label="xu204",fontsize=16,color="green",shape="box"];8980[label="xu205",fontsize=16,color="green",shape="box"];8981[label="Succ xu206",fontsize=16,color="green",shape="box"];8982[label="Succ xu205",fontsize=16,color="green",shape="box"];8978[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat xu283 xu284) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat xu283 xu284)) (primPlusInt (primMinusNat xu283 xu284) (primPlusInt (primMinusNat xu283 xu284) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat xu283 xu284) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];14978[label="xu283/Succ xu2830",fontsize=10,color="white",style="solid",shape="box"];8978 -> 14978[label="",style="solid", color="burlywood", weight=9];
14978 -> 9023[label="",style="solid", color="burlywood", weight=3];
14979[label="xu283/Zero",fontsize=10,color="white",style="solid",shape="box"];8978 -> 14979[label="",style="solid", color="burlywood", weight=9];
14979 -> 9024[label="",style="solid", color="burlywood", weight=3];
9925[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu301))) (Pos xu302) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))) True)\n  Enum a",fontsize=16,color="black",shape="box"];9925 -> 10046[label="",style="solid", color="black", weight=3];
9926[label="toEnum (Pos xu302) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu301))) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))))\n  Enum a",fontsize=16,color="green",shape="box"];9926 -> 10047[label="",style="dashed", color="green", weight=3];
9926 -> 10048[label="",style="dashed", color="green", weight=3];
5960[label="map toEnum (Pos (Succ xu235) : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)))))\n  Enum a",fontsize=16,color="black",shape="box"];5960 -> 5985[label="",style="solid", color="black", weight=3];
9084[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu2780)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];9084 -> 9118[label="",style="solid", color="black", weight=3];
9085[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Neg (Succ xu2790)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];9085 -> 9119[label="",style="solid", color="black", weight=3];
9086[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];9086 -> 9120[label="",style="solid", color="black", weight=3];
5980[label="toEnum (Pos (Succ xu230)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))))\n  Enum a",fontsize=16,color="green",shape="box"];5980 -> 6080[label="",style="dashed", color="green", weight=3];
5980 -> 6081[label="",style="dashed", color="green", weight=3];
10173 -> 808[label="",style="dashed", color="red", weight=0];
10173[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];10174[label="toEnum (Pos xu309)\n  Enum a",fontsize=16,color="blue",shape="box"];14981[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14981[label="",style="solid", color="blue", weight=9];
14981 -> 10358[label="",style="solid", color="blue", weight=3];
14982[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14982[label="",style="solid", color="blue", weight=9];
14982 -> 10359[label="",style="solid", color="blue", weight=3];
14983[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14983[label="",style="solid", color="blue", weight=9];
14983 -> 10360[label="",style="solid", color="blue", weight=3];
14984[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14984[label="",style="solid", color="blue", weight=9];
14984 -> 10361[label="",style="solid", color="blue", weight=3];
14985[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14985[label="",style="solid", color="blue", weight=9];
14985 -> 10362[label="",style="solid", color="blue", weight=3];
14986[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14986[label="",style="solid", color="blue", weight=9];
14986 -> 10363[label="",style="solid", color="blue", weight=3];
14987[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14987[label="",style="solid", color="blue", weight=9];
14987 -> 10364[label="",style="solid", color="blue", weight=3];
14988[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14988[label="",style="solid", color="blue", weight=9];
14988 -> 10365[label="",style="solid", color="blue", weight=3];
14989[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];10174 -> 14989[label="",style="solid", color="blue", weight=9];
14989 -> 10366[label="",style="solid", color="blue", weight=3];
10175[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu308))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu310))))\n  Enum a",fontsize=16,color="black",shape="box"];10175 -> 10367[label="",style="solid", color="black", weight=3];
8758 -> 8466[label="",style="dashed", color="red", weight=0];
8758[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (primMinusNat xu2740 xu2750) (Pos (Succ xu276))) (iterate (primPlusInt (primMinusNat xu2740 xu2750)) (primPlusInt (primMinusNat xu2740 xu2750) (primPlusInt (primMinusNat xu2740 xu2750) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (primMinusNat xu2740 xu2750) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="magenta"];8758 -> 8921[label="",style="dashed", color="magenta", weight=3];
8758 -> 8922[label="",style="dashed", color="magenta", weight=3];
8759 -> 8167[label="",style="dashed", color="red", weight=0];
8759[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (Pos (Succ xu2740)) (Pos (Succ xu276))) (iterate (primPlusInt (Pos (Succ xu2740))) (primPlusInt (Pos (Succ xu2740)) (primPlusInt (Pos (Succ xu2740)) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (Pos (Succ xu2740)) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="magenta"];8759 -> 8923[label="",style="dashed", color="magenta", weight=3];
8759 -> 8924[label="",style="dashed", color="magenta", weight=3];
8759 -> 8925[label="",style="dashed", color="magenta", weight=3];
8760[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (Neg (Succ xu2750)) (Pos (Succ xu276))) (iterate (primPlusInt (Neg (Succ xu2750))) (primPlusInt (Neg (Succ xu2750)) (primPlusInt (Neg (Succ xu2750)) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (Neg (Succ xu2750)) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];8760 -> 8926[label="",style="solid", color="black", weight=3];
8761 -> 8514[label="",style="dashed", color="red", weight=0];
8761[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primPlusInt (Pos Zero) (Pos (Succ xu276))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu276))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ xu276))) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="magenta"];8761 -> 8927[label="",style="dashed", color="magenta", weight=3];
8761 -> 8928[label="",style="dashed", color="magenta", weight=3];
9023[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat (Succ xu2830) xu284) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat (Succ xu2830) xu284)) (primPlusInt (primMinusNat (Succ xu2830) xu284) (primPlusInt (primMinusNat (Succ xu2830) xu284) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2830) xu284) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14993[label="xu284/Succ xu2840",fontsize=10,color="white",style="solid",shape="box"];9023 -> 14993[label="",style="solid", color="burlywood", weight=9];
14993 -> 9043[label="",style="solid", color="burlywood", weight=3];
14994[label="xu284/Zero",fontsize=10,color="white",style="solid",shape="box"];9023 -> 14994[label="",style="solid", color="burlywood", weight=9];
14994 -> 9044[label="",style="solid", color="burlywood", weight=3];
9024[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat Zero xu284) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat Zero xu284)) (primPlusInt (primMinusNat Zero xu284) (primPlusInt (primMinusNat Zero xu284) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat Zero xu284) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];14995[label="xu284/Succ xu2840",fontsize=10,color="white",style="solid",shape="box"];9024 -> 14995[label="",style="solid", color="burlywood", weight=9];
14995 -> 9045[label="",style="solid", color="burlywood", weight=3];
14996[label="xu284/Zero",fontsize=10,color="white",style="solid",shape="box"];9024 -> 14996[label="",style="solid", color="burlywood", weight=9];
14996 -> 9046[label="",style="solid", color="burlywood", weight=3];
10046 -> 808[label="",style="dashed", color="red", weight=0];
10046[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];10047[label="toEnum (Pos xu302)\n  Enum a",fontsize=16,color="blue",shape="box"];14998[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];10047 -> 14998[label="",style="solid", color="blue", weight=9];
14998 -> 10176[label="",style="solid", color="blue", weight=3];
14999[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];10047 -> 14999[label="",style="solid", color="blue", weight=9];
14999 -> 10177[label="",style="solid", color="blue", weight=3];
15000[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];10047 -> 15000[label="",style="solid", color="blue", weight=9];
15000 -> 10178[label="",style="solid", color="blue", weight=3];
15001[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];10047 -> 15001[label="",style="solid", color="blue", weight=9];
15001 -> 10179[label="",style="solid", color="blue", weight=3];
15002[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];10047 -> 15002[label="",style="solid", color="blue", weight=9];
15002 -> 10180[label="",style="solid", color="blue", weight=3];
15003[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];10047 -> 15003[label="",style="solid", color="blue", weight=9];
15003 -> 10181[label="",style="solid", color="blue", weight=3];
15004[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];10047 -> 15004[label="",style="solid", color="blue", weight=9];
15004 -> 10182[label="",style="solid", color="blue", weight=3];
15005[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];10047 -> 15005[label="",style="solid", color="blue", weight=9];
15005 -> 10183[label="",style="solid", color="blue", weight=3];
15006[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];10047 -> 15006[label="",style="solid", color="blue", weight=9];
15006 -> 10184[label="",style="solid", color="blue", weight=3];
10048[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu301))) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (Pos xu304))))\n  Enum a",fontsize=16,color="black",shape="box"];10048 -> 10185[label="",style="solid", color="black", weight=3];
5985[label="toEnum (Pos (Succ xu235)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)))))\n  Enum a",fontsize=16,color="green",shape="box"];5985 -> 6086[label="",style="dashed", color="green", weight=3];
5985 -> 6087[label="",style="dashed", color="green", weight=3];
9118[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ xu2780)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];9118 -> 9126[label="",style="solid", color="black", weight=3];
9119[label="map toEnum (takeWhile0 (flip (>=) (Pos Zero)) (Neg (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Neg (Succ xu2790)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];9119 -> 9127[label="",style="solid", color="black", weight=3];
9120[label="map toEnum (Pos Zero : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];9120 -> 9128[label="",style="solid", color="black", weight=3];
6080[label="toEnum (Pos (Succ xu230))\n  Enum a",fontsize=16,color="blue",shape="box"];15007[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15007[label="",style="solid", color="blue", weight=9];
15007 -> 6158[label="",style="solid", color="blue", weight=3];
15008[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15008[label="",style="solid", color="blue", weight=9];
15008 -> 6159[label="",style="solid", color="blue", weight=3];
15009[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15009[label="",style="solid", color="blue", weight=9];
15009 -> 6160[label="",style="solid", color="blue", weight=3];
15010[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15010[label="",style="solid", color="blue", weight=9];
15010 -> 6161[label="",style="solid", color="blue", weight=3];
15011[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15011[label="",style="solid", color="blue", weight=9];
15011 -> 6162[label="",style="solid", color="blue", weight=3];
15012[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15012[label="",style="solid", color="blue", weight=9];
15012 -> 6163[label="",style="solid", color="blue", weight=3];
15013[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15013[label="",style="solid", color="blue", weight=9];
15013 -> 6164[label="",style="solid", color="blue", weight=3];
15014[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15014[label="",style="solid", color="blue", weight=9];
15014 -> 6165[label="",style="solid", color="blue", weight=3];
15015[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];6080 -> 15015[label="",style="solid", color="blue", weight=9];
15015 -> 6166[label="",style="solid", color="blue", weight=3];
6081[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)))))\n  Enum a",fontsize=16,color="black",shape="box"];6081 -> 6167[label="",style="solid", color="black", weight=3];
10358 -> 10348[label="",style="dashed", color="red", weight=0];
10358[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10358 -> 10567[label="",style="dashed", color="magenta", weight=3];
10359 -> 10349[label="",style="dashed", color="red", weight=0];
10359[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10359 -> 10568[label="",style="dashed", color="magenta", weight=3];
10360 -> 10350[label="",style="dashed", color="red", weight=0];
10360[label="toEnum (Pos xu309)\n  Integral a",fontsize=16,color="magenta"];10360 -> 10569[label="",style="dashed", color="magenta", weight=3];
10361 -> 10351[label="",style="dashed", color="red", weight=0];
10361[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10361 -> 10570[label="",style="dashed", color="magenta", weight=3];
10362 -> 10352[label="",style="dashed", color="red", weight=0];
10362[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10362 -> 10571[label="",style="dashed", color="magenta", weight=3];
10363 -> 10353[label="",style="dashed", color="red", weight=0];
10363[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10363 -> 10572[label="",style="dashed", color="magenta", weight=3];
10364 -> 10354[label="",style="dashed", color="red", weight=0];
10364[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10364 -> 10573[label="",style="dashed", color="magenta", weight=3];
10365 -> 10355[label="",style="dashed", color="red", weight=0];
10365[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10365 -> 10574[label="",style="dashed", color="magenta", weight=3];
10366 -> 10356[label="",style="dashed", color="red", weight=0];
10366[label="toEnum (Pos xu309)",fontsize=16,color="magenta"];10366 -> 10575[label="",style="dashed", color="magenta", weight=3];
10367[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu308))) (primPlusInt (Pos Zero) (Pos xu310) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu310)))))\n  Enum a",fontsize=16,color="black",shape="box"];10367 -> 10576[label="",style="solid", color="black", weight=3];
8921[label="xu2750",fontsize=16,color="green",shape="box"];8922[label="xu2740",fontsize=16,color="green",shape="box"];8923[label="xu273",fontsize=16,color="green",shape="box"];8924[label="xu2740",fontsize=16,color="green",shape="box"];8925[label="Succ xu276",fontsize=16,color="green",shape="box"];8167[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (primPlusInt (Pos (Succ xu1980000)) (Pos xu241)) (iterate (primPlusInt (Pos (Succ xu1980000))) (primPlusInt (Pos (Succ xu1980000)) (primPlusInt (Pos (Succ xu1980000)) (Pos xu241)))) (not (primCmpInt (primPlusInt (Pos (Succ xu1980000)) (Pos xu241)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];8167 -> 8217[label="",style="solid", color="black", weight=3];
8926 -> 12186[label="",style="dashed", color="red", weight=0];
8926[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu273))) (primMinusNat (Succ xu276) (Succ xu2750)) (iterate (primPlusInt (Neg (Succ xu2750))) (primPlusInt (Neg (Succ xu2750)) (primMinusNat (Succ xu276) (Succ xu2750)))) (not (primCmpInt (primMinusNat (Succ xu276) (Succ xu2750)) (Pos (Succ xu273)) == GT)))\n  Enum a",fontsize=16,color="magenta"];8926 -> 12187[label="",style="dashed", color="magenta", weight=3];
8926 -> 12188[label="",style="dashed", color="magenta", weight=3];
8926 -> 12189[label="",style="dashed", color="magenta", weight=3];
8926 -> 12190[label="",style="dashed", color="magenta", weight=3];
8927[label="xu273",fontsize=16,color="green",shape="box"];8928[label="Succ xu276",fontsize=16,color="green",shape="box"];8514[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (primPlusInt (Pos Zero) (Pos xu250)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu250)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos xu250)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];8514 -> 8707[label="",style="solid", color="black", weight=3];
9043[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat (Succ xu2830) (Succ xu2840)) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat (Succ xu2830) (Succ xu2840))) (primPlusInt (primMinusNat (Succ xu2830) (Succ xu2840)) (primPlusInt (primMinusNat (Succ xu2830) (Succ xu2840)) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2830) (Succ xu2840)) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9043 -> 9066[label="",style="solid", color="black", weight=3];
9044[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat (Succ xu2830) Zero) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat (Succ xu2830) Zero)) (primPlusInt (primMinusNat (Succ xu2830) Zero) (primPlusInt (primMinusNat (Succ xu2830) Zero) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ xu2830) Zero) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9044 -> 9067[label="",style="solid", color="black", weight=3];
9045[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat Zero (Succ xu2840)) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat Zero (Succ xu2840))) (primPlusInt (primMinusNat Zero (Succ xu2840)) (primPlusInt (primMinusNat Zero (Succ xu2840)) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ xu2840)) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9045 -> 9068[label="",style="solid", color="black", weight=3];
9046[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9046 -> 9069[label="",style="solid", color="black", weight=3];
10176 -> 6857[label="",style="dashed", color="red", weight=0];
10176[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10176 -> 10368[label="",style="dashed", color="magenta", weight=3];
10177 -> 6858[label="",style="dashed", color="red", weight=0];
10177[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10177 -> 10369[label="",style="dashed", color="magenta", weight=3];
10178 -> 6859[label="",style="dashed", color="red", weight=0];
10178[label="toEnum (Pos xu302)\n  Integral a",fontsize=16,color="magenta"];10178 -> 10370[label="",style="dashed", color="magenta", weight=3];
10179 -> 6860[label="",style="dashed", color="red", weight=0];
10179[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10179 -> 10371[label="",style="dashed", color="magenta", weight=3];
10180 -> 6861[label="",style="dashed", color="red", weight=0];
10180[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10180 -> 10372[label="",style="dashed", color="magenta", weight=3];
10181 -> 6862[label="",style="dashed", color="red", weight=0];
10181[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10181 -> 10373[label="",style="dashed", color="magenta", weight=3];
10182 -> 6863[label="",style="dashed", color="red", weight=0];
10182[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10182 -> 10374[label="",style="dashed", color="magenta", weight=3];
10183 -> 6864[label="",style="dashed", color="red", weight=0];
10183[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10183 -> 10375[label="",style="dashed", color="magenta", weight=3];
10184 -> 6865[label="",style="dashed", color="red", weight=0];
10184[label="toEnum (Pos xu302)",fontsize=16,color="magenta"];10184 -> 10376[label="",style="dashed", color="magenta", weight=3];
10185[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu301))) (primPlusInt (Pos (Succ xu303)) (Pos xu304) : iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (primPlusInt (Pos (Succ xu303)) (Pos xu304)))))\n  Enum a",fontsize=16,color="black",shape="box"];10185 -> 10377[label="",style="solid", color="black", weight=3];
6086[label="toEnum (Pos (Succ xu235))\n  Enum a",fontsize=16,color="blue",shape="box"];15035[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15035[label="",style="solid", color="blue", weight=9];
15035 -> 6168[label="",style="solid", color="blue", weight=3];
15036[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15036[label="",style="solid", color="blue", weight=9];
15036 -> 6169[label="",style="solid", color="blue", weight=3];
15037[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15037[label="",style="solid", color="blue", weight=9];
15037 -> 6170[label="",style="solid", color="blue", weight=3];
15038[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15038[label="",style="solid", color="blue", weight=9];
15038 -> 6171[label="",style="solid", color="blue", weight=3];
15039[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15039[label="",style="solid", color="blue", weight=9];
15039 -> 6172[label="",style="solid", color="blue", weight=3];
15040[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15040[label="",style="solid", color="blue", weight=9];
15040 -> 6173[label="",style="solid", color="blue", weight=3];
15041[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15041[label="",style="solid", color="blue", weight=9];
15041 -> 6174[label="",style="solid", color="blue", weight=3];
15042[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15042[label="",style="solid", color="blue", weight=9];
15042 -> 6175[label="",style="solid", color="blue", weight=3];
15043[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];6086 -> 15043[label="",style="solid", color="blue", weight=9];
15043 -> 6176[label="",style="solid", color="blue", weight=3];
6087[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)))))\n  Enum a",fontsize=16,color="black",shape="box"];6087 -> 6177[label="",style="solid", color="black", weight=3];
9126[label="map toEnum (Pos (Succ xu2780) : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))))\n  Enum a",fontsize=16,color="black",shape="box"];9126 -> 9135[label="",style="solid", color="black", weight=3];
9127[label="map toEnum (takeWhile0 (flip (>=) (Pos Zero)) (Neg (Succ xu2790)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Neg (Succ xu2790)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];9127 -> 9136[label="",style="solid", color="black", weight=3];
9128[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos Zero))))\n  Enum a",fontsize=16,color="green",shape="box"];9128 -> 9137[label="",style="dashed", color="green", weight=3];
9128 -> 9138[label="",style="dashed", color="green", weight=3];
6158[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6158 -> 14160[label="",style="solid", color="black", weight=3];
6159[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6159 -> 14161[label="",style="solid", color="black", weight=3];
6160[label="toEnum (Pos (Succ xu230))\n  Integral a",fontsize=16,color="black",shape="box"];6160 -> 14162[label="",style="solid", color="black", weight=3];
6161[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6161 -> 14163[label="",style="solid", color="black", weight=3];
6162[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6162 -> 14164[label="",style="solid", color="black", weight=3];
6163[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6163 -> 14165[label="",style="solid", color="black", weight=3];
6164[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6164 -> 14166[label="",style="solid", color="black", weight=3];
6165[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6165 -> 14167[label="",style="solid", color="black", weight=3];
6166[label="toEnum (Pos (Succ xu230))",fontsize=16,color="black",shape="box"];6166 -> 14168[label="",style="solid", color="black", weight=3];
6167[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))))\n  Enum a",fontsize=16,color="black",shape="box"];6167 -> 6233[label="",style="solid", color="black", weight=3];
10567[label="Pos xu309",fontsize=16,color="green",shape="box"];10348[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10348 -> 10557[label="",style="solid", color="black", weight=3];
10568[label="Pos xu309",fontsize=16,color="green",shape="box"];10349[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10349 -> 10558[label="",style="solid", color="black", weight=3];
10569[label="Pos xu309",fontsize=16,color="green",shape="box"];10350[label="toEnum xu315\n  Integral a",fontsize=16,color="black",shape="triangle"];10350 -> 10559[label="",style="solid", color="black", weight=3];
10570[label="Pos xu309",fontsize=16,color="green",shape="box"];10351[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10351 -> 10560[label="",style="solid", color="black", weight=3];
10571[label="Pos xu309",fontsize=16,color="green",shape="box"];10352[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10352 -> 10561[label="",style="solid", color="black", weight=3];
10572[label="Pos xu309",fontsize=16,color="green",shape="box"];10353[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10353 -> 10562[label="",style="solid", color="black", weight=3];
10573[label="Pos xu309",fontsize=16,color="green",shape="box"];10354[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10354 -> 10563[label="",style="solid", color="black", weight=3];
10574[label="Pos xu309",fontsize=16,color="green",shape="box"];10355[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10355 -> 10564[label="",style="solid", color="black", weight=3];
10575[label="Pos xu309",fontsize=16,color="green",shape="box"];10356[label="toEnum xu315",fontsize=16,color="black",shape="triangle"];10356 -> 10565[label="",style="solid", color="black", weight=3];
10576[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu308))) (primPlusInt (Pos Zero) (Pos xu310) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu310)))))\n  Enum a",fontsize=16,color="black",shape="box"];10576 -> 10605[label="",style="solid", color="black", weight=3];
8217 -> 6016[label="",style="dashed", color="red", weight=0];
8217[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (primPlusNat (Succ xu1980000) xu241)) (iterate (primPlusInt (Pos (Succ xu1980000))) (primPlusInt (Pos (Succ xu1980000)) (Pos (primPlusNat (Succ xu1980000) xu241)))) (not (primCmpInt (Pos (primPlusNat (Succ xu1980000) xu241)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="magenta"];8217 -> 8391[label="",style="dashed", color="magenta", weight=3];
8217 -> 8392[label="",style="dashed", color="magenta", weight=3];
8217 -> 8393[label="",style="dashed", color="magenta", weight=3];
12187[label="xu273",fontsize=16,color="green",shape="box"];12188[label="xu2750",fontsize=16,color="green",shape="box"];12189[label="Succ xu276",fontsize=16,color="green",shape="box"];12190[label="Succ xu2750",fontsize=16,color="green",shape="box"];12186[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat xu333 xu334) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat xu333 xu334))) (not (primCmpInt (primMinusNat xu333 xu334) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15045[label="xu333/Succ xu3330",fontsize=10,color="white",style="solid",shape="box"];12186 -> 15045[label="",style="solid", color="burlywood", weight=9];
15045 -> 12239[label="",style="solid", color="burlywood", weight=3];
15046[label="xu333/Zero",fontsize=10,color="white",style="solid",shape="box"];12186 -> 15046[label="",style="solid", color="burlywood", weight=9];
15046 -> 12240[label="",style="solid", color="burlywood", weight=3];
8707 -> 6269[label="",style="dashed", color="red", weight=0];
8707[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu196))) (Pos (primPlusNat Zero xu250)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero xu250)))) (not (primCmpInt (Pos (primPlusNat Zero xu250)) (Pos (Succ xu196)) == GT)))\n  Enum a",fontsize=16,color="magenta"];8707 -> 8769[label="",style="dashed", color="magenta", weight=3];
8707 -> 8770[label="",style="dashed", color="magenta", weight=3];
8707 -> 8771[label="",style="dashed", color="magenta", weight=3];
9066 -> 8978[label="",style="dashed", color="red", weight=0];
9066[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (primMinusNat xu2830 xu2840) (Pos (Succ xu285))) (iterate (primPlusInt (primMinusNat xu2830 xu2840)) (primPlusInt (primMinusNat xu2830 xu2840) (primPlusInt (primMinusNat xu2830 xu2840) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (primMinusNat xu2830 xu2840) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="magenta"];9066 -> 9087[label="",style="dashed", color="magenta", weight=3];
9066 -> 9088[label="",style="dashed", color="magenta", weight=3];
9067[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (Pos (Succ xu2830)) (Pos (Succ xu285))) (iterate (primPlusInt (Pos (Succ xu2830))) (primPlusInt (Pos (Succ xu2830)) (primPlusInt (Pos (Succ xu2830)) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (Pos (Succ xu2830)) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9067 -> 9089[label="",style="solid", color="black", weight=3];
9068[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (Neg (Succ xu2840)) (Pos (Succ xu285))) (iterate (primPlusInt (Neg (Succ xu2840))) (primPlusInt (Neg (Succ xu2840)) (primPlusInt (Neg (Succ xu2840)) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (Neg (Succ xu2840)) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];9068 -> 9090[label="",style="solid", color="black", weight=3];
9069[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primPlusInt (Pos Zero) (Pos (Succ xu285))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu285))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9069 -> 9091[label="",style="solid", color="black", weight=3];
10368[label="xu302",fontsize=16,color="green",shape="box"];6857[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6857 -> 7024[label="",style="solid", color="black", weight=3];
10369[label="xu302",fontsize=16,color="green",shape="box"];6858[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6858 -> 7025[label="",style="solid", color="black", weight=3];
10370[label="xu302",fontsize=16,color="green",shape="box"];6859[label="toEnum (Pos xu240)\n  Integral a",fontsize=16,color="black",shape="triangle"];6859 -> 7026[label="",style="solid", color="black", weight=3];
10371[label="xu302",fontsize=16,color="green",shape="box"];6860[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6860 -> 7027[label="",style="solid", color="black", weight=3];
10372[label="xu302",fontsize=16,color="green",shape="box"];6861[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6861 -> 7028[label="",style="solid", color="black", weight=3];
10373[label="xu302",fontsize=16,color="green",shape="box"];6862[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6862 -> 7029[label="",style="solid", color="black", weight=3];
10374[label="xu302",fontsize=16,color="green",shape="box"];6863[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6863 -> 7030[label="",style="solid", color="black", weight=3];
10375[label="xu302",fontsize=16,color="green",shape="box"];6864[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6864 -> 7031[label="",style="solid", color="black", weight=3];
10376[label="xu302",fontsize=16,color="green",shape="box"];6865[label="toEnum (Pos xu240)",fontsize=16,color="black",shape="triangle"];6865 -> 7032[label="",style="solid", color="black", weight=3];
10377[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu301))) (primPlusInt (Pos (Succ xu303)) (Pos xu304) : iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (primPlusInt (Pos (Succ xu303)) (Pos xu304)))))\n  Enum a",fontsize=16,color="black",shape="box"];10377 -> 10577[label="",style="solid", color="black", weight=3];
6168[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6168 -> 14169[label="",style="solid", color="black", weight=3];
6169[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6169 -> 14170[label="",style="solid", color="black", weight=3];
6170[label="toEnum (Pos (Succ xu235))\n  Integral a",fontsize=16,color="black",shape="box"];6170 -> 14171[label="",style="solid", color="black", weight=3];
6171[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6171 -> 14172[label="",style="solid", color="black", weight=3];
6172[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6172 -> 14173[label="",style="solid", color="black", weight=3];
6173[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6173 -> 14174[label="",style="solid", color="black", weight=3];
6174[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6174 -> 14175[label="",style="solid", color="black", weight=3];
6175[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6175 -> 14176[label="",style="solid", color="black", weight=3];
6176[label="toEnum (Pos (Succ xu235))",fontsize=16,color="black",shape="box"];6176 -> 14177[label="",style="solid", color="black", weight=3];
6177[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)) : iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))))))\n  Enum a",fontsize=16,color="black",shape="box"];6177 -> 6243[label="",style="solid", color="black", weight=3];
9135[label="toEnum (Pos (Succ xu2780)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))))\n  Enum a",fontsize=16,color="green",shape="box"];9135 -> 9175[label="",style="dashed", color="green", weight=3];
9135 -> 9176[label="",style="dashed", color="green", weight=3];
9136 -> 808[label="",style="dashed", color="red", weight=0];
9136[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];9137[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];15050[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15050[label="",style="solid", color="blue", weight=9];
15050 -> 9177[label="",style="solid", color="blue", weight=3];
15051[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15051[label="",style="solid", color="blue", weight=9];
15051 -> 9178[label="",style="solid", color="blue", weight=3];
15052[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15052[label="",style="solid", color="blue", weight=9];
15052 -> 9179[label="",style="solid", color="blue", weight=3];
15053[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15053[label="",style="solid", color="blue", weight=9];
15053 -> 9180[label="",style="solid", color="blue", weight=3];
15054[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15054[label="",style="solid", color="blue", weight=9];
15054 -> 9181[label="",style="solid", color="blue", weight=3];
15055[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15055[label="",style="solid", color="blue", weight=9];
15055 -> 9182[label="",style="solid", color="blue", weight=3];
15056[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15056[label="",style="solid", color="blue", weight=9];
15056 -> 9183[label="",style="solid", color="blue", weight=3];
15057[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15057[label="",style="solid", color="blue", weight=9];
15057 -> 9184[label="",style="solid", color="blue", weight=3];
15058[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];9137 -> 15058[label="",style="solid", color="blue", weight=9];
15058 -> 9185[label="",style="solid", color="blue", weight=3];
9138[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];9138 -> 9186[label="",style="solid", color="black", weight=3];
14160[label="error []",fontsize=16,color="red",shape="box"];14161[label="error []",fontsize=16,color="red",shape="box"];14162[label="error []",fontsize=16,color="red",shape="box"];14163[label="error []",fontsize=16,color="red",shape="box"];14164[label="error []",fontsize=16,color="red",shape="box"];14165[label="error []",fontsize=16,color="red",shape="box"];14166[label="error []",fontsize=16,color="red",shape="box"];14167[label="error []",fontsize=16,color="red",shape="box"];14168 -> 10565[label="",style="dashed", color="red", weight=0];
14168[label="primIntToChar (Pos (Succ xu230))",fontsize=16,color="magenta"];14168 -> 14384[label="",style="dashed", color="magenta", weight=3];
6233[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230)) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))))\n  Enum a",fontsize=16,color="black",shape="box"];6233 -> 6336[label="",style="solid", color="black", weight=3];
10557[label="error []",fontsize=16,color="red",shape="box"];10558[label="error []",fontsize=16,color="red",shape="box"];10559[label="error []",fontsize=16,color="red",shape="box"];10560[label="error []",fontsize=16,color="red",shape="box"];10561[label="error []",fontsize=16,color="red",shape="box"];10562[label="error []",fontsize=16,color="red",shape="box"];10563[label="error []",fontsize=16,color="red",shape="box"];10564[label="error []",fontsize=16,color="red",shape="box"];10605[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (primPlusInt (Pos Zero) (Pos xu310)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu310)))) (flip (<=) (Pos (Succ xu308)) (primPlusInt (Pos Zero) (Pos xu310))))\n  Enum a",fontsize=16,color="black",shape="box"];10605 -> 10753[label="",style="solid", color="black", weight=3];
8391 -> 5891[label="",style="dashed", color="red", weight=0];
8391[label="primPlusNat (Succ xu1980000) xu241",fontsize=16,color="magenta"];8391 -> 8522[label="",style="dashed", color="magenta", weight=3];
8391 -> 8523[label="",style="dashed", color="magenta", weight=3];
8392 -> 5891[label="",style="dashed", color="red", weight=0];
8392[label="primPlusNat (Succ xu1980000) xu241",fontsize=16,color="magenta"];8392 -> 8524[label="",style="dashed", color="magenta", weight=3];
8392 -> 8525[label="",style="dashed", color="magenta", weight=3];
8393 -> 5891[label="",style="dashed", color="red", weight=0];
8393[label="primPlusNat (Succ xu1980000) xu241",fontsize=16,color="magenta"];8393 -> 8526[label="",style="dashed", color="magenta", weight=3];
8393 -> 8527[label="",style="dashed", color="magenta", weight=3];
12239[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat (Succ xu3330) xu334) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat (Succ xu3330) xu334))) (not (primCmpInt (primMinusNat (Succ xu3330) xu334) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15063[label="xu334/Succ xu3340",fontsize=10,color="white",style="solid",shape="box"];12239 -> 15063[label="",style="solid", color="burlywood", weight=9];
15063 -> 12406[label="",style="solid", color="burlywood", weight=3];
15064[label="xu334/Zero",fontsize=10,color="white",style="solid",shape="box"];12239 -> 15064[label="",style="solid", color="burlywood", weight=9];
15064 -> 12407[label="",style="solid", color="burlywood", weight=3];
12240[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat Zero xu334) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat Zero xu334))) (not (primCmpInt (primMinusNat Zero xu334) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15065[label="xu334/Succ xu3340",fontsize=10,color="white",style="solid",shape="box"];12240 -> 15065[label="",style="solid", color="burlywood", weight=9];
15065 -> 12408[label="",style="solid", color="burlywood", weight=3];
15066[label="xu334/Zero",fontsize=10,color="white",style="solid",shape="box"];12240 -> 15066[label="",style="solid", color="burlywood", weight=9];
15066 -> 12409[label="",style="solid", color="burlywood", weight=3];
8769 -> 5891[label="",style="dashed", color="red", weight=0];
8769[label="primPlusNat Zero xu250",fontsize=16,color="magenta"];8769 -> 8934[label="",style="dashed", color="magenta", weight=3];
8769 -> 8935[label="",style="dashed", color="magenta", weight=3];
8770 -> 5891[label="",style="dashed", color="red", weight=0];
8770[label="primPlusNat Zero xu250",fontsize=16,color="magenta"];8770 -> 8936[label="",style="dashed", color="magenta", weight=3];
8770 -> 8937[label="",style="dashed", color="magenta", weight=3];
8771 -> 5891[label="",style="dashed", color="red", weight=0];
8771[label="primPlusNat Zero xu250",fontsize=16,color="magenta"];8771 -> 8938[label="",style="dashed", color="magenta", weight=3];
8771 -> 8939[label="",style="dashed", color="magenta", weight=3];
9087[label="xu2830",fontsize=16,color="green",shape="box"];9088[label="xu2840",fontsize=16,color="green",shape="box"];9089 -> 9121[label="",style="dashed", color="red", weight=0];
9089[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos (primPlusNat (Succ xu2830) (Succ xu285))) (iterate (primPlusInt (Pos (Succ xu2830))) (primPlusInt (Pos (Succ xu2830)) (Pos (primPlusNat (Succ xu2830) (Succ xu285))))) (not (primCmpInt (Pos (primPlusNat (Succ xu2830) (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="magenta"];9089 -> 9122[label="",style="dashed", color="magenta", weight=3];
9089 -> 9123[label="",style="dashed", color="magenta", weight=3];
9089 -> 9124[label="",style="dashed", color="magenta", weight=3];
9090 -> 12639[label="",style="dashed", color="red", weight=0];
9090[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (primMinusNat (Succ xu285) (Succ xu2840)) (iterate (primPlusInt (Neg (Succ xu2840))) (primPlusInt (Neg (Succ xu2840)) (primMinusNat (Succ xu285) (Succ xu2840)))) (not (primCmpInt (primMinusNat (Succ xu285) (Succ xu2840)) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="magenta"];9090 -> 12640[label="",style="dashed", color="magenta", weight=3];
9090 -> 12641[label="",style="dashed", color="magenta", weight=3];
9090 -> 12642[label="",style="dashed", color="magenta", weight=3];
9090 -> 12643[label="",style="dashed", color="magenta", weight=3];
9091 -> 9130[label="",style="dashed", color="red", weight=0];
9091[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos (primPlusNat Zero (Succ xu285))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero (Succ xu285))))) (not (primCmpInt (Pos (primPlusNat Zero (Succ xu285))) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="magenta"];9091 -> 9131[label="",style="dashed", color="magenta", weight=3];
9091 -> 9132[label="",style="dashed", color="magenta", weight=3];
9091 -> 9133[label="",style="dashed", color="magenta", weight=3];
7024[label="error []",fontsize=16,color="red",shape="box"];7025[label="error []",fontsize=16,color="red",shape="box"];7026[label="error []",fontsize=16,color="red",shape="box"];7027[label="error []",fontsize=16,color="red",shape="box"];7028[label="error []",fontsize=16,color="red",shape="box"];7029[label="error []",fontsize=16,color="red",shape="box"];7030[label="error []",fontsize=16,color="red",shape="box"];7031[label="error []",fontsize=16,color="red",shape="box"];7032[label="primIntToChar (Pos xu240)",fontsize=16,color="black",shape="box"];7032 -> 7223[label="",style="solid", color="black", weight=3];
10577[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (primPlusInt (Pos (Succ xu303)) (Pos xu304)))) (flip (<=) (Pos (Succ xu301)) (primPlusInt (Pos (Succ xu303)) (Pos xu304))))\n  Enum a",fontsize=16,color="black",shape="box"];10577 -> 10608[label="",style="solid", color="black", weight=3];
14169[label="error []",fontsize=16,color="red",shape="box"];14170[label="error []",fontsize=16,color="red",shape="box"];14171[label="error []",fontsize=16,color="red",shape="box"];14172[label="error []",fontsize=16,color="red",shape="box"];14173[label="error []",fontsize=16,color="red",shape="box"];14174[label="error []",fontsize=16,color="red",shape="box"];14175[label="error []",fontsize=16,color="red",shape="box"];14176[label="error []",fontsize=16,color="red",shape="box"];14177 -> 10565[label="",style="dashed", color="red", weight=0];
14177[label="primIntToChar (Pos (Succ xu235))",fontsize=16,color="magenta"];14177 -> 14385[label="",style="dashed", color="magenta", weight=3];
6243[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)) : iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))))))\n  Enum a",fontsize=16,color="black",shape="box"];6243 -> 6337[label="",style="solid", color="black", weight=3];
9175[label="toEnum (Pos (Succ xu2780))\n  Enum a",fontsize=16,color="blue",shape="box"];15074[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15074[label="",style="solid", color="blue", weight=9];
15074 -> 9215[label="",style="solid", color="blue", weight=3];
15075[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15075[label="",style="solid", color="blue", weight=9];
15075 -> 9216[label="",style="solid", color="blue", weight=3];
15076[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15076[label="",style="solid", color="blue", weight=9];
15076 -> 9217[label="",style="solid", color="blue", weight=3];
15077[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15077[label="",style="solid", color="blue", weight=9];
15077 -> 9218[label="",style="solid", color="blue", weight=3];
15078[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15078[label="",style="solid", color="blue", weight=9];
15078 -> 9219[label="",style="solid", color="blue", weight=3];
15079[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15079[label="",style="solid", color="blue", weight=9];
15079 -> 9220[label="",style="solid", color="blue", weight=3];
15080[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15080[label="",style="solid", color="blue", weight=9];
15080 -> 9221[label="",style="solid", color="blue", weight=3];
15081[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15081[label="",style="solid", color="blue", weight=9];
15081 -> 9222[label="",style="solid", color="blue", weight=3];
15082[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];9175 -> 15082[label="",style="solid", color="blue", weight=9];
15082 -> 9223[label="",style="solid", color="blue", weight=3];
9176[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))))\n  Enum a",fontsize=16,color="black",shape="box"];9176 -> 9224[label="",style="solid", color="black", weight=3];
9177 -> 6857[label="",style="dashed", color="red", weight=0];
9177[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9177 -> 9225[label="",style="dashed", color="magenta", weight=3];
9178 -> 6858[label="",style="dashed", color="red", weight=0];
9178[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9178 -> 9226[label="",style="dashed", color="magenta", weight=3];
9179 -> 6859[label="",style="dashed", color="red", weight=0];
9179[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="magenta"];9179 -> 9227[label="",style="dashed", color="magenta", weight=3];
9180 -> 6860[label="",style="dashed", color="red", weight=0];
9180[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9180 -> 9228[label="",style="dashed", color="magenta", weight=3];
9181 -> 6861[label="",style="dashed", color="red", weight=0];
9181[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9181 -> 9229[label="",style="dashed", color="magenta", weight=3];
9182 -> 6862[label="",style="dashed", color="red", weight=0];
9182[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9182 -> 9230[label="",style="dashed", color="magenta", weight=3];
9183 -> 6863[label="",style="dashed", color="red", weight=0];
9183[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9183 -> 9231[label="",style="dashed", color="magenta", weight=3];
9184 -> 6864[label="",style="dashed", color="red", weight=0];
9184[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9184 -> 9232[label="",style="dashed", color="magenta", weight=3];
9185 -> 6865[label="",style="dashed", color="red", weight=0];
9185[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];9185 -> 9233[label="",style="dashed", color="magenta", weight=3];
9186[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos Zero) : iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];9186 -> 9234[label="",style="solid", color="black", weight=3];
14384[label="Pos (Succ xu230)",fontsize=16,color="green",shape="box"];6336[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))) (flip (>=) (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230)))))\n  Enum a",fontsize=16,color="black",shape="box"];6336 -> 6445[label="",style="solid", color="black", weight=3];
10753[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (primPlusInt (Pos Zero) (Pos xu310)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu310)))) ((<=) primPlusInt (Pos Zero) (Pos xu310) Pos (Succ xu308)))\n  Enum a",fontsize=16,color="black",shape="box"];10753 -> 10972[label="",style="solid", color="black", weight=3];
8522[label="Succ xu1980000",fontsize=16,color="green",shape="box"];8523[label="xu241",fontsize=16,color="green",shape="box"];8524[label="Succ xu1980000",fontsize=16,color="green",shape="box"];8525[label="xu241",fontsize=16,color="green",shape="box"];8526[label="Succ xu1980000",fontsize=16,color="green",shape="box"];8527[label="xu241",fontsize=16,color="green",shape="box"];12406[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat (Succ xu3330) (Succ xu3340)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat (Succ xu3330) (Succ xu3340)))) (not (primCmpInt (primMinusNat (Succ xu3330) (Succ xu3340)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12406 -> 12617[label="",style="solid", color="black", weight=3];
12407[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat (Succ xu3330) Zero) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat (Succ xu3330) Zero))) (not (primCmpInt (primMinusNat (Succ xu3330) Zero) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12407 -> 12618[label="",style="solid", color="black", weight=3];
12408[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat Zero (Succ xu3340)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat Zero (Succ xu3340)))) (not (primCmpInt (primMinusNat Zero (Succ xu3340)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12408 -> 12619[label="",style="solid", color="black", weight=3];
12409[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat Zero Zero) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat Zero Zero))) (not (primCmpInt (primMinusNat Zero Zero) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12409 -> 12620[label="",style="solid", color="black", weight=3];
8934[label="Zero",fontsize=16,color="green",shape="box"];8935[label="xu250",fontsize=16,color="green",shape="box"];8936[label="Zero",fontsize=16,color="green",shape="box"];8937[label="xu250",fontsize=16,color="green",shape="box"];8938[label="Zero",fontsize=16,color="green",shape="box"];8939[label="xu250",fontsize=16,color="green",shape="box"];9122 -> 5891[label="",style="dashed", color="red", weight=0];
9122[label="primPlusNat (Succ xu2830) (Succ xu285)",fontsize=16,color="magenta"];9122 -> 9139[label="",style="dashed", color="magenta", weight=3];
9122 -> 9140[label="",style="dashed", color="magenta", weight=3];
9123 -> 5891[label="",style="dashed", color="red", weight=0];
9123[label="primPlusNat (Succ xu2830) (Succ xu285)",fontsize=16,color="magenta"];9123 -> 9141[label="",style="dashed", color="magenta", weight=3];
9123 -> 9142[label="",style="dashed", color="magenta", weight=3];
9124 -> 5891[label="",style="dashed", color="red", weight=0];
9124[label="primPlusNat (Succ xu2830) (Succ xu285)",fontsize=16,color="magenta"];9124 -> 9143[label="",style="dashed", color="magenta", weight=3];
9124 -> 9144[label="",style="dashed", color="magenta", weight=3];
9121[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu290) (iterate (primPlusInt (Pos (Succ xu2830))) (primPlusInt (Pos (Succ xu2830)) (Pos xu291))) (not (primCmpInt (Pos xu292) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15095[label="xu292/Succ xu2920",fontsize=10,color="white",style="solid",shape="box"];9121 -> 15095[label="",style="solid", color="burlywood", weight=9];
15095 -> 9145[label="",style="solid", color="burlywood", weight=3];
15096[label="xu292/Zero",fontsize=10,color="white",style="solid",shape="box"];9121 -> 15096[label="",style="solid", color="burlywood", weight=9];
15096 -> 9146[label="",style="solid", color="burlywood", weight=3];
12640[label="Succ xu2840",fontsize=16,color="green",shape="box"];12641[label="Succ xu285",fontsize=16,color="green",shape="box"];12642[label="xu2840",fontsize=16,color="green",shape="box"];12643[label="xu282",fontsize=16,color="green",shape="box"];12639[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat xu339 xu340) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat xu339 xu340))) (not (primCmpInt (primMinusNat xu339 xu340) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15097[label="xu339/Succ xu3390",fontsize=10,color="white",style="solid",shape="box"];12639 -> 15097[label="",style="solid", color="burlywood", weight=9];
15097 -> 12680[label="",style="solid", color="burlywood", weight=3];
15098[label="xu339/Zero",fontsize=10,color="white",style="solid",shape="box"];12639 -> 15098[label="",style="solid", color="burlywood", weight=9];
15098 -> 12681[label="",style="solid", color="burlywood", weight=3];
9131 -> 5891[label="",style="dashed", color="red", weight=0];
9131[label="primPlusNat Zero (Succ xu285)",fontsize=16,color="magenta"];9131 -> 9149[label="",style="dashed", color="magenta", weight=3];
9131 -> 9150[label="",style="dashed", color="magenta", weight=3];
9132 -> 5891[label="",style="dashed", color="red", weight=0];
9132[label="primPlusNat Zero (Succ xu285)",fontsize=16,color="magenta"];9132 -> 9151[label="",style="dashed", color="magenta", weight=3];
9132 -> 9152[label="",style="dashed", color="magenta", weight=3];
9133 -> 5891[label="",style="dashed", color="red", weight=0];
9133[label="primPlusNat Zero (Succ xu285)",fontsize=16,color="magenta"];9133 -> 9153[label="",style="dashed", color="magenta", weight=3];
9133 -> 9154[label="",style="dashed", color="magenta", weight=3];
9130[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu293) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu294))) (not (primCmpInt (Pos xu295) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15102[label="xu295/Succ xu2950",fontsize=10,color="white",style="solid",shape="box"];9130 -> 15102[label="",style="solid", color="burlywood", weight=9];
15102 -> 9155[label="",style="solid", color="burlywood", weight=3];
15103[label="xu295/Zero",fontsize=10,color="white",style="solid",shape="box"];9130 -> 15103[label="",style="solid", color="burlywood", weight=9];
15103 -> 9156[label="",style="solid", color="burlywood", weight=3];
7223[label="Char xu240",fontsize=16,color="green",shape="box"];10608[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (primPlusInt (Pos (Succ xu303)) (Pos xu304)))) ((<=) primPlusInt (Pos (Succ xu303)) (Pos xu304) Pos (Succ xu301)))\n  Enum a",fontsize=16,color="black",shape="box"];10608 -> 10757[label="",style="solid", color="black", weight=3];
14385[label="Pos (Succ xu235)",fontsize=16,color="green",shape="box"];6337[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))))) (flip (>=) (Pos Zero) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)))))\n  Enum a",fontsize=16,color="black",shape="box"];6337 -> 6446[label="",style="solid", color="black", weight=3];
9215[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9215 -> 14178[label="",style="solid", color="black", weight=3];
9216[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9216 -> 14179[label="",style="solid", color="black", weight=3];
9217[label="toEnum (Pos (Succ xu2780))\n  Integral a",fontsize=16,color="black",shape="box"];9217 -> 14180[label="",style="solid", color="black", weight=3];
9218[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9218 -> 14181[label="",style="solid", color="black", weight=3];
9219[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9219 -> 14182[label="",style="solid", color="black", weight=3];
9220[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9220 -> 14183[label="",style="solid", color="black", weight=3];
9221[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9221 -> 14184[label="",style="solid", color="black", weight=3];
9222[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9222 -> 14185[label="",style="solid", color="black", weight=3];
9223[label="toEnum (Pos (Succ xu2780))",fontsize=16,color="black",shape="box"];9223 -> 14186[label="",style="solid", color="black", weight=3];
9224[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)) : iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))))))\n  Enum a",fontsize=16,color="black",shape="box"];9224 -> 9289[label="",style="solid", color="black", weight=3];
9225[label="Zero",fontsize=16,color="green",shape="box"];9226[label="Zero",fontsize=16,color="green",shape="box"];9227[label="Zero",fontsize=16,color="green",shape="box"];9228[label="Zero",fontsize=16,color="green",shape="box"];9229[label="Zero",fontsize=16,color="green",shape="box"];9230[label="Zero",fontsize=16,color="green",shape="box"];9231[label="Zero",fontsize=16,color="green",shape="box"];9232[label="Zero",fontsize=16,color="green",shape="box"];9233[label="Zero",fontsize=16,color="green",shape="box"];9234[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos Zero) : iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];9234 -> 9290[label="",style="solid", color="black", weight=3];
6445[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))) ((>=) primPlusInt (Pos Zero) (Pos (Succ xu230)) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];6445 -> 6527[label="",style="solid", color="black", weight=3];
10972[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (primPlusInt (Pos Zero) (Pos xu310)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu310)))) (compare (primPlusInt (Pos Zero) (Pos xu310)) (Pos (Succ xu308)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];10972 -> 11173[label="",style="solid", color="black", weight=3];
12617 -> 12186[label="",style="dashed", color="red", weight=0];
12617[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat xu3330 xu3340) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat xu3330 xu3340))) (not (primCmpInt (primMinusNat xu3330 xu3340) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="magenta"];12617 -> 12682[label="",style="dashed", color="magenta", weight=3];
12617 -> 12683[label="",style="dashed", color="magenta", weight=3];
12618[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Pos (Succ xu3330)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos (Succ xu3330)))) (not (primCmpInt (Pos (Succ xu3330)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12618 -> 12684[label="",style="solid", color="black", weight=3];
12619 -> 13362[label="",style="dashed", color="red", weight=0];
12619[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg (Succ xu3340)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg (Succ xu3340)))) (not (primCmpInt (Neg (Succ xu3340)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="magenta"];12619 -> 13363[label="",style="dashed", color="magenta", weight=3];
12619 -> 13364[label="",style="dashed", color="magenta", weight=3];
12619 -> 13365[label="",style="dashed", color="magenta", weight=3];
12620[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12620 -> 12686[label="",style="solid", color="black", weight=3];
9139[label="Succ xu2830",fontsize=16,color="green",shape="box"];9140[label="Succ xu285",fontsize=16,color="green",shape="box"];9141[label="Succ xu2830",fontsize=16,color="green",shape="box"];9142[label="Succ xu285",fontsize=16,color="green",shape="box"];9143[label="Succ xu2830",fontsize=16,color="green",shape="box"];9144[label="Succ xu285",fontsize=16,color="green",shape="box"];9145[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu290) (iterate (primPlusInt (Pos (Succ xu2830))) (primPlusInt (Pos (Succ xu2830)) (Pos xu291))) (not (primCmpInt (Pos (Succ xu2920)) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9145 -> 9187[label="",style="solid", color="black", weight=3];
9146[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu290) (iterate (primPlusInt (Pos (Succ xu2830))) (primPlusInt (Pos (Succ xu2830)) (Pos xu291))) (not (primCmpInt (Pos Zero) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9146 -> 9188[label="",style="solid", color="black", weight=3];
12680[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat (Succ xu3390) xu340) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat (Succ xu3390) xu340))) (not (primCmpInt (primMinusNat (Succ xu3390) xu340) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15106[label="xu340/Succ xu3400",fontsize=10,color="white",style="solid",shape="box"];12680 -> 15106[label="",style="solid", color="burlywood", weight=9];
15106 -> 12718[label="",style="solid", color="burlywood", weight=3];
15107[label="xu340/Zero",fontsize=10,color="white",style="solid",shape="box"];12680 -> 15107[label="",style="solid", color="burlywood", weight=9];
15107 -> 12719[label="",style="solid", color="burlywood", weight=3];
12681[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat Zero xu340) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat Zero xu340))) (not (primCmpInt (primMinusNat Zero xu340) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15108[label="xu340/Succ xu3400",fontsize=10,color="white",style="solid",shape="box"];12681 -> 15108[label="",style="solid", color="burlywood", weight=9];
15108 -> 12720[label="",style="solid", color="burlywood", weight=3];
15109[label="xu340/Zero",fontsize=10,color="white",style="solid",shape="box"];12681 -> 15109[label="",style="solid", color="burlywood", weight=9];
15109 -> 12721[label="",style="solid", color="burlywood", weight=3];
9149[label="Zero",fontsize=16,color="green",shape="box"];9150[label="Succ xu285",fontsize=16,color="green",shape="box"];9151[label="Zero",fontsize=16,color="green",shape="box"];9152[label="Succ xu285",fontsize=16,color="green",shape="box"];9153[label="Zero",fontsize=16,color="green",shape="box"];9154[label="Succ xu285",fontsize=16,color="green",shape="box"];9155[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu293) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu294))) (not (primCmpInt (Pos (Succ xu2950)) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9155 -> 9193[label="",style="solid", color="black", weight=3];
9156[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu293) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu294))) (not (primCmpInt (Pos Zero) (Pos (Succ xu282)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9156 -> 9194[label="",style="solid", color="black", weight=3];
10757[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (primPlusInt (Pos (Succ xu303)) (Pos xu304)))) (compare (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (Pos (Succ xu301)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];10757 -> 10975[label="",style="solid", color="black", weight=3];
6446[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))))) ((>=) primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235)) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];6446 -> 6528[label="",style="solid", color="black", weight=3];
14178[label="error []",fontsize=16,color="red",shape="box"];14179[label="error []",fontsize=16,color="red",shape="box"];14180[label="error []",fontsize=16,color="red",shape="box"];14181[label="error []",fontsize=16,color="red",shape="box"];14182[label="error []",fontsize=16,color="red",shape="box"];14183[label="error []",fontsize=16,color="red",shape="box"];14184[label="error []",fontsize=16,color="red",shape="box"];14185[label="error []",fontsize=16,color="red",shape="box"];14186 -> 10565[label="",style="dashed", color="red", weight=0];
14186[label="primIntToChar (Pos (Succ xu2780))",fontsize=16,color="magenta"];14186 -> 14386[label="",style="dashed", color="magenta", weight=3];
9289[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)) : iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))))))\n  Enum a",fontsize=16,color="black",shape="box"];9289 -> 9325[label="",style="solid", color="black", weight=3];
9290[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)))) (flip (>=) (Pos Zero) (primPlusInt (Neg (Succ xu280)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];9290 -> 9326[label="",style="solid", color="black", weight=3];
6527[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))) (compare (primPlusInt (Pos Zero) (Pos (Succ xu230))) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];6527 -> 6638[label="",style="solid", color="black", weight=3];
11173[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (primPlusInt (Pos Zero) (Pos xu310)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu310)))) (not (compare (primPlusInt (Pos Zero) (Pos xu310)) (Pos (Succ xu308)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];11173 -> 11352[label="",style="solid", color="black", weight=3];
12682[label="xu3330",fontsize=16,color="green",shape="box"];12683[label="xu3340",fontsize=16,color="green",shape="box"];12684 -> 14507[label="",style="dashed", color="red", weight=0];
12684[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Pos (Succ xu3330)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos (Succ xu3330)))) (not (primCmpNat (Succ xu3330) (Succ xu332) == GT)))\n  Enum a",fontsize=16,color="magenta"];12684 -> 14508[label="",style="dashed", color="magenta", weight=3];
12684 -> 14509[label="",style="dashed", color="magenta", weight=3];
12684 -> 14510[label="",style="dashed", color="magenta", weight=3];
12684 -> 14511[label="",style="dashed", color="magenta", weight=3];
12684 -> 14512[label="",style="dashed", color="magenta", weight=3];
13363[label="Succ xu3340",fontsize=16,color="green",shape="box"];13364[label="Succ xu3340",fontsize=16,color="green",shape="box"];13365[label="Succ xu3340",fontsize=16,color="green",shape="box"];13362[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg xu355) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))) (not (primCmpInt (Neg xu357) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15112[label="xu357/Succ xu3570",fontsize=10,color="white",style="solid",shape="box"];13362 -> 15112[label="",style="solid", color="burlywood", weight=9];
15112 -> 13369[label="",style="solid", color="burlywood", weight=3];
15113[label="xu357/Zero",fontsize=10,color="white",style="solid",shape="box"];13362 -> 15113[label="",style="solid", color="burlywood", weight=9];
15113 -> 13370[label="",style="solid", color="burlywood", weight=3];
12686[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))) (not (primCmpNat Zero (Succ xu332) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12686 -> 12724[label="",style="solid", color="black", weight=3];
9187 -> 12792[label="",style="dashed", color="red", weight=0];
9187[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu290) (iterate (primPlusInt (Pos (Succ xu2830))) (primPlusInt (Pos (Succ xu2830)) (Pos xu291))) (not (primCmpNat (Succ xu2920) (Succ xu282) == LT)))\n  Enum a",fontsize=16,color="magenta"];9187 -> 12793[label="",style="dashed", color="magenta", weight=3];
9187 -> 12794[label="",style="dashed", color="magenta", weight=3];
9187 -> 12795[label="",style="dashed", color="magenta", weight=3];
9187 -> 12796[label="",style="dashed", color="magenta", weight=3];
9187 -> 12797[label="",style="dashed", color="magenta", weight=3];
9187 -> 12798[label="",style="dashed", color="magenta", weight=3];
9188 -> 12792[label="",style="dashed", color="red", weight=0];
9188[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu290) (iterate (primPlusInt (Pos (Succ xu2830))) (primPlusInt (Pos (Succ xu2830)) (Pos xu291))) (not (primCmpNat Zero (Succ xu282) == LT)))\n  Enum a",fontsize=16,color="magenta"];9188 -> 12799[label="",style="dashed", color="magenta", weight=3];
9188 -> 12800[label="",style="dashed", color="magenta", weight=3];
9188 -> 12801[label="",style="dashed", color="magenta", weight=3];
9188 -> 12802[label="",style="dashed", color="magenta", weight=3];
9188 -> 12803[label="",style="dashed", color="magenta", weight=3];
9188 -> 12804[label="",style="dashed", color="magenta", weight=3];
12718[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat (Succ xu3390) (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat (Succ xu3390) (Succ xu3400)))) (not (primCmpInt (primMinusNat (Succ xu3390) (Succ xu3400)) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12718 -> 12761[label="",style="solid", color="black", weight=3];
12719[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat (Succ xu3390) Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat (Succ xu3390) Zero))) (not (primCmpInt (primMinusNat (Succ xu3390) Zero) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12719 -> 12762[label="",style="solid", color="black", weight=3];
12720[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat Zero (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat Zero (Succ xu3400)))) (not (primCmpInt (primMinusNat Zero (Succ xu3400)) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12720 -> 12763[label="",style="solid", color="black", weight=3];
12721[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat Zero Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat Zero Zero))) (not (primCmpInt (primMinusNat Zero Zero) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12721 -> 12764[label="",style="solid", color="black", weight=3];
9193 -> 12872[label="",style="dashed", color="red", weight=0];
9193[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu293) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu294))) (not (primCmpNat (Succ xu2950) (Succ xu282) == LT)))\n  Enum a",fontsize=16,color="magenta"];9193 -> 12873[label="",style="dashed", color="magenta", weight=3];
9193 -> 12874[label="",style="dashed", color="magenta", weight=3];
9193 -> 12875[label="",style="dashed", color="magenta", weight=3];
9193 -> 12876[label="",style="dashed", color="magenta", weight=3];
9193 -> 12877[label="",style="dashed", color="magenta", weight=3];
9194 -> 12872[label="",style="dashed", color="red", weight=0];
9194[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu282))) (Pos xu293) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu294))) (not (primCmpNat Zero (Succ xu282) == LT)))\n  Enum a",fontsize=16,color="magenta"];9194 -> 12878[label="",style="dashed", color="magenta", weight=3];
9194 -> 12879[label="",style="dashed", color="magenta", weight=3];
9194 -> 12880[label="",style="dashed", color="magenta", weight=3];
9194 -> 12881[label="",style="dashed", color="magenta", weight=3];
9194 -> 12882[label="",style="dashed", color="magenta", weight=3];
10975[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (primPlusInt (Pos (Succ xu303)) (Pos xu304)))) (not (compare (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (Pos (Succ xu301)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10975 -> 11174[label="",style="solid", color="black", weight=3];
6528[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))))) (compare (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];6528 -> 6639[label="",style="solid", color="black", weight=3];
14386[label="Pos (Succ xu2780)",fontsize=16,color="green",shape="box"];9325[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))))) (flip (>=) (Pos Zero) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)))))\n  Enum a",fontsize=16,color="black",shape="box"];9325 -> 9430[label="",style="solid", color="black", weight=3];
9326[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)))) ((>=) primPlusInt (Neg (Succ xu280)) (Pos Zero) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];9326 -> 9431[label="",style="solid", color="black", weight=3];
6638[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))) (not (compare (primPlusInt (Pos Zero) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6638 -> 6790[label="",style="solid", color="black", weight=3];
11352 -> 8514[label="",style="dashed", color="red", weight=0];
11352[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu308))) (primPlusInt (Pos Zero) (Pos xu310)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu310)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos xu310)) (Pos (Succ xu308)) == GT)))\n  Enum a",fontsize=16,color="magenta"];11352 -> 11405[label="",style="dashed", color="magenta", weight=3];
11352 -> 11406[label="",style="dashed", color="magenta", weight=3];
14508[label="Succ xu3330",fontsize=16,color="green",shape="box"];14509[label="Succ xu332",fontsize=16,color="green",shape="box"];14510[label="xu335",fontsize=16,color="green",shape="box"];14511[label="xu332",fontsize=16,color="green",shape="box"];14512[label="xu3330",fontsize=16,color="green",shape="box"];14507[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat xu389 xu390 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15119[label="xu389/Succ xu3890",fontsize=10,color="white",style="solid",shape="box"];14507 -> 15119[label="",style="solid", color="burlywood", weight=9];
15119 -> 14563[label="",style="solid", color="burlywood", weight=3];
15120[label="xu389/Zero",fontsize=10,color="white",style="solid",shape="box"];14507 -> 15120[label="",style="solid", color="burlywood", weight=9];
15120 -> 14564[label="",style="solid", color="burlywood", weight=3];
13369[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg xu355) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))) (not (primCmpInt (Neg (Succ xu3570)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];13369 -> 13404[label="",style="solid", color="black", weight=3];
13370[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg xu355) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))) (not (primCmpInt (Neg Zero) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];13370 -> 13405[label="",style="solid", color="black", weight=3];
12724[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];12724 -> 12768[label="",style="solid", color="black", weight=3];
12793[label="xu290",fontsize=16,color="green",shape="box"];12794[label="Succ xu282",fontsize=16,color="green",shape="box"];12795[label="xu282",fontsize=16,color="green",shape="box"];12796[label="Succ xu2920",fontsize=16,color="green",shape="box"];12797[label="xu2830",fontsize=16,color="green",shape="box"];12798[label="xu291",fontsize=16,color="green",shape="box"];12792[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat xu347 xu348 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15121[label="xu347/Succ xu3470",fontsize=10,color="white",style="solid",shape="box"];12792 -> 15121[label="",style="solid", color="burlywood", weight=9];
15121 -> 12859[label="",style="solid", color="burlywood", weight=3];
15122[label="xu347/Zero",fontsize=10,color="white",style="solid",shape="box"];12792 -> 15122[label="",style="solid", color="burlywood", weight=9];
15122 -> 12860[label="",style="solid", color="burlywood", weight=3];
12799[label="xu290",fontsize=16,color="green",shape="box"];12800[label="Succ xu282",fontsize=16,color="green",shape="box"];12801[label="xu282",fontsize=16,color="green",shape="box"];12802[label="Zero",fontsize=16,color="green",shape="box"];12803[label="xu2830",fontsize=16,color="green",shape="box"];12804[label="xu291",fontsize=16,color="green",shape="box"];12761 -> 12639[label="",style="dashed", color="red", weight=0];
12761[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (primMinusNat xu3390 xu3400) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (primMinusNat xu3390 xu3400))) (not (primCmpInt (primMinusNat xu3390 xu3400) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="magenta"];12761 -> 12861[label="",style="dashed", color="magenta", weight=3];
12761 -> 12862[label="",style="dashed", color="magenta", weight=3];
12762[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Pos (Succ xu3390)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos (Succ xu3390)))) (not (primCmpInt (Pos (Succ xu3390)) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12762 -> 12863[label="",style="solid", color="black", weight=3];
12763[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Neg (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Neg (Succ xu3400)))) (not (primCmpInt (Neg (Succ xu3400)) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12763 -> 12864[label="",style="solid", color="black", weight=3];
12764[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ xu338)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12764 -> 12865[label="",style="solid", color="black", weight=3];
12873[label="xu293",fontsize=16,color="green",shape="box"];12874[label="xu294",fontsize=16,color="green",shape="box"];12875[label="xu282",fontsize=16,color="green",shape="box"];12876[label="Succ xu2950",fontsize=16,color="green",shape="box"];12877[label="Succ xu282",fontsize=16,color="green",shape="box"];12872[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat xu353 xu354 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15124[label="xu353/Succ xu3530",fontsize=10,color="white",style="solid",shape="box"];12872 -> 15124[label="",style="solid", color="burlywood", weight=9];
15124 -> 12928[label="",style="solid", color="burlywood", weight=3];
15125[label="xu353/Zero",fontsize=10,color="white",style="solid",shape="box"];12872 -> 15125[label="",style="solid", color="burlywood", weight=9];
15125 -> 12929[label="",style="solid", color="burlywood", weight=3];
12878[label="xu293",fontsize=16,color="green",shape="box"];12879[label="xu294",fontsize=16,color="green",shape="box"];12880[label="xu282",fontsize=16,color="green",shape="box"];12881[label="Zero",fontsize=16,color="green",shape="box"];12882[label="Succ xu282",fontsize=16,color="green",shape="box"];11174 -> 8167[label="",style="dashed", color="red", weight=0];
11174[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu301))) (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (iterate (primPlusInt (Pos (Succ xu303))) (primPlusInt (Pos (Succ xu303)) (primPlusInt (Pos (Succ xu303)) (Pos xu304)))) (not (primCmpInt (primPlusInt (Pos (Succ xu303)) (Pos xu304)) (Pos (Succ xu301)) == GT)))\n  Enum a",fontsize=16,color="magenta"];11174 -> 11353[label="",style="dashed", color="magenta", weight=3];
11174 -> 11354[label="",style="dashed", color="magenta", weight=3];
11174 -> 11355[label="",style="dashed", color="magenta", weight=3];
6639[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))))) (not (compare (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6639 -> 6791[label="",style="solid", color="black", weight=3];
9430[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))))) ((>=) primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780)) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];9430 -> 9528[label="",style="solid", color="black", weight=3];
9431[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)))) (compare (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];9431 -> 9529[label="",style="solid", color="black", weight=3];
6790 -> 5630[label="",style="dashed", color="red", weight=0];
6790[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ xu230))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ xu230))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ xu230))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];11405[label="xu308",fontsize=16,color="green",shape="box"];11406[label="xu310",fontsize=16,color="green",shape="box"];14563[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat (Succ xu3890) xu390 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15128[label="xu390/Succ xu3900",fontsize=10,color="white",style="solid",shape="box"];14563 -> 15128[label="",style="solid", color="burlywood", weight=9];
15128 -> 14593[label="",style="solid", color="burlywood", weight=3];
15129[label="xu390/Zero",fontsize=10,color="white",style="solid",shape="box"];14563 -> 15129[label="",style="solid", color="burlywood", weight=9];
15129 -> 14594[label="",style="solid", color="burlywood", weight=3];
14564[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat Zero xu390 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15130[label="xu390/Succ xu3900",fontsize=10,color="white",style="solid",shape="box"];14564 -> 15130[label="",style="solid", color="burlywood", weight=9];
15130 -> 14595[label="",style="solid", color="burlywood", weight=3];
15131[label="xu390/Zero",fontsize=10,color="white",style="solid",shape="box"];14564 -> 15131[label="",style="solid", color="burlywood", weight=9];
15131 -> 14596[label="",style="solid", color="burlywood", weight=3];
13404[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg xu355) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];13404 -> 13470[label="",style="solid", color="black", weight=3];
13405 -> 13404[label="",style="dashed", color="red", weight=0];
13405[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg xu355) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))) (not (LT == GT)))\n  Enum a",fontsize=16,color="magenta"];12768[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];12768 -> 12871[label="",style="solid", color="black", weight=3];
12859[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat (Succ xu3470) xu348 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15133[label="xu348/Succ xu3480",fontsize=10,color="white",style="solid",shape="box"];12859 -> 15133[label="",style="solid", color="burlywood", weight=9];
15133 -> 12930[label="",style="solid", color="burlywood", weight=3];
15134[label="xu348/Zero",fontsize=10,color="white",style="solid",shape="box"];12859 -> 15134[label="",style="solid", color="burlywood", weight=9];
15134 -> 12931[label="",style="solid", color="burlywood", weight=3];
12860[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat Zero xu348 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15135[label="xu348/Succ xu3480",fontsize=10,color="white",style="solid",shape="box"];12860 -> 15135[label="",style="solid", color="burlywood", weight=9];
15135 -> 12932[label="",style="solid", color="burlywood", weight=3];
15136[label="xu348/Zero",fontsize=10,color="white",style="solid",shape="box"];12860 -> 15136[label="",style="solid", color="burlywood", weight=9];
15136 -> 12933[label="",style="solid", color="burlywood", weight=3];
12861[label="xu3400",fontsize=16,color="green",shape="box"];12862[label="xu3390",fontsize=16,color="green",shape="box"];12863 -> 14648[label="",style="dashed", color="red", weight=0];
12863[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Pos (Succ xu3390)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos (Succ xu3390)))) (not (primCmpNat (Succ xu3390) (Succ xu338) == LT)))\n  Enum a",fontsize=16,color="magenta"];12863 -> 14649[label="",style="dashed", color="magenta", weight=3];
12863 -> 14650[label="",style="dashed", color="magenta", weight=3];
12863 -> 14651[label="",style="dashed", color="magenta", weight=3];
12863 -> 14652[label="",style="dashed", color="magenta", weight=3];
12863 -> 14653[label="",style="dashed", color="magenta", weight=3];
12864[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Neg (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Neg (Succ xu3400)))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12864 -> 12935[label="",style="solid", color="black", weight=3];
12865[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos Zero))) (not (primCmpNat Zero (Succ xu338) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12865 -> 12936[label="",style="solid", color="black", weight=3];
12928[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat (Succ xu3530) xu354 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15138[label="xu354/Succ xu3540",fontsize=10,color="white",style="solid",shape="box"];12928 -> 15138[label="",style="solid", color="burlywood", weight=9];
15138 -> 12943[label="",style="solid", color="burlywood", weight=3];
15139[label="xu354/Zero",fontsize=10,color="white",style="solid",shape="box"];12928 -> 15139[label="",style="solid", color="burlywood", weight=9];
15139 -> 12944[label="",style="solid", color="burlywood", weight=3];
12929[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat Zero xu354 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15140[label="xu354/Succ xu3540",fontsize=10,color="white",style="solid",shape="box"];12929 -> 15140[label="",style="solid", color="burlywood", weight=9];
15140 -> 12945[label="",style="solid", color="burlywood", weight=3];
15141[label="xu354/Zero",fontsize=10,color="white",style="solid",shape="box"];12929 -> 15141[label="",style="solid", color="burlywood", weight=9];
15141 -> 12946[label="",style="solid", color="burlywood", weight=3];
11353[label="xu301",fontsize=16,color="green",shape="box"];11354[label="xu303",fontsize=16,color="green",shape="box"];11355[label="xu304",fontsize=16,color="green",shape="box"];6791 -> 5628[label="",style="dashed", color="red", weight=0];
6791[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (iterate (primPlusInt (Pos (Succ xu236))) (primPlusInt (Pos (Succ xu236)) (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))))) (not (primCmpInt (primPlusInt (Pos (Succ xu236)) (Pos (Succ xu235))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];6791 -> 6891[label="",style="dashed", color="magenta", weight=3];
6791 -> 6892[label="",style="dashed", color="magenta", weight=3];
9528[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))))) (compare (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];9528 -> 9591[label="",style="solid", color="black", weight=3];
9529[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)))) (not (compare (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9529 -> 9592[label="",style="solid", color="black", weight=3];
14593[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat (Succ xu3890) (Succ xu3900) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14593 -> 14609[label="",style="solid", color="black", weight=3];
14594[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat (Succ xu3890) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14594 -> 14610[label="",style="solid", color="black", weight=3];
14595[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat Zero (Succ xu3900) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14595 -> 14611[label="",style="solid", color="black", weight=3];
14596[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14596 -> 14612[label="",style="solid", color="black", weight=3];
13470[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg xu355) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];13470 -> 13539[label="",style="solid", color="black", weight=3];
12871[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];12871 -> 12942[label="",style="solid", color="black", weight=3];
12930[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat (Succ xu3470) (Succ xu3480) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12930 -> 12947[label="",style="solid", color="black", weight=3];
12931[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat (Succ xu3470) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12931 -> 12948[label="",style="solid", color="black", weight=3];
12932[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat Zero (Succ xu3480) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12932 -> 12949[label="",style="solid", color="black", weight=3];
12933[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12933 -> 12950[label="",style="solid", color="black", weight=3];
14649[label="xu3390",fontsize=16,color="green",shape="box"];14650[label="Succ xu3390",fontsize=16,color="green",shape="box"];14651[label="xu338",fontsize=16,color="green",shape="box"];14652[label="Succ xu338",fontsize=16,color="green",shape="box"];14653[label="xu341",fontsize=16,color="green",shape="box"];14648[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat xu408 xu409 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];15143[label="xu408/Succ xu4080",fontsize=10,color="white",style="solid",shape="box"];14648 -> 15143[label="",style="solid", color="burlywood", weight=9];
15143 -> 14704[label="",style="solid", color="burlywood", weight=3];
15144[label="xu408/Zero",fontsize=10,color="white",style="solid",shape="box"];14648 -> 15144[label="",style="solid", color="burlywood", weight=9];
15144 -> 14705[label="",style="solid", color="burlywood", weight=3];
12935[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Neg (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Neg (Succ xu3400)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];12935 -> 12953[label="",style="solid", color="black", weight=3];
12936[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos Zero))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12936 -> 12954[label="",style="solid", color="black", weight=3];
12943[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat (Succ xu3530) (Succ xu3540) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12943 -> 12963[label="",style="solid", color="black", weight=3];
12944[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat (Succ xu3530) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12944 -> 12964[label="",style="solid", color="black", weight=3];
12945[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat Zero (Succ xu3540) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12945 -> 12965[label="",style="solid", color="black", weight=3];
12946[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12946 -> 12966[label="",style="solid", color="black", weight=3];
6891[label="xu236",fontsize=16,color="green",shape="box"];6892[label="xu235",fontsize=16,color="green",shape="box"];9591[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))))) (not (compare (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9591 -> 9667[label="",style="solid", color="black", weight=3];
9592[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Neg (Succ xu280)) (Pos Zero)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];9592 -> 9668[label="",style="solid", color="black", weight=3];
14609 -> 14507[label="",style="dashed", color="red", weight=0];
14609[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (primCmpNat xu3890 xu3900 == GT)))\n  Enum a",fontsize=16,color="magenta"];14609 -> 14616[label="",style="dashed", color="magenta", weight=3];
14609 -> 14617[label="",style="dashed", color="magenta", weight=3];
14610[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14610 -> 14618[label="",style="solid", color="black", weight=3];
14611[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14611 -> 14619[label="",style="solid", color="black", weight=3];
14612[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14612 -> 14620[label="",style="solid", color="black", weight=3];
13539[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg xu355) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))) True)\n  Enum a",fontsize=16,color="black",shape="box"];13539 -> 13569[label="",style="solid", color="black", weight=3];
12942[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos (Succ xu332))) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];12942 -> 12962[label="",style="solid", color="black", weight=3];
12947 -> 12792[label="",style="dashed", color="red", weight=0];
12947[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (primCmpNat xu3470 xu3480 == LT)))\n  Enum a",fontsize=16,color="magenta"];12947 -> 12967[label="",style="dashed", color="magenta", weight=3];
12947 -> 12968[label="",style="dashed", color="magenta", weight=3];
12948[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12948 -> 12969[label="",style="solid", color="black", weight=3];
12949[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12949 -> 12970[label="",style="solid", color="black", weight=3];
12950[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12950 -> 12971[label="",style="solid", color="black", weight=3];
14704[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat (Succ xu4080) xu409 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15147[label="xu409/Succ xu4090",fontsize=10,color="white",style="solid",shape="box"];14704 -> 15147[label="",style="solid", color="burlywood", weight=9];
15147 -> 14708[label="",style="solid", color="burlywood", weight=3];
15148[label="xu409/Zero",fontsize=10,color="white",style="solid",shape="box"];14704 -> 15148[label="",style="solid", color="burlywood", weight=9];
15148 -> 14709[label="",style="solid", color="burlywood", weight=3];
14705[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat Zero xu409 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];15149[label="xu409/Succ xu4090",fontsize=10,color="white",style="solid",shape="box"];14705 -> 15149[label="",style="solid", color="burlywood", weight=9];
15149 -> 14710[label="",style="solid", color="burlywood", weight=3];
15150[label="xu409/Zero",fontsize=10,color="white",style="solid",shape="box"];14705 -> 15150[label="",style="solid", color="burlywood", weight=9];
15150 -> 14711[label="",style="solid", color="burlywood", weight=3];
12953[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Neg (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Neg (Succ xu3400)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];12953 -> 12976[label="",style="solid", color="black", weight=3];
12954[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos Zero))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];12954 -> 12977[label="",style="solid", color="black", weight=3];
12963 -> 12872[label="",style="dashed", color="red", weight=0];
12963[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (primCmpNat xu3530 xu3540 == LT)))\n  Enum a",fontsize=16,color="magenta"];12963 -> 12997[label="",style="dashed", color="magenta", weight=3];
12963 -> 12998[label="",style="dashed", color="magenta", weight=3];
12964[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12964 -> 12999[label="",style="solid", color="black", weight=3];
12965[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12965 -> 13000[label="",style="solid", color="black", weight=3];
12966[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12966 -> 13001[label="",style="solid", color="black", weight=3];
9667 -> 5629[label="",style="dashed", color="red", weight=0];
9667[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))))) (not (primCmpInt (primPlusInt (Neg (Succ xu280)) (Pos (Succ xu2780))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];9667 -> 9737[label="",style="dashed", color="magenta", weight=3];
9667 -> 9738[label="",style="dashed", color="magenta", weight=3];
9668 -> 8716[label="",style="dashed", color="red", weight=0];
9668[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero (Succ xu280)) (iterate (primPlusInt (Neg (Succ xu280))) (primPlusInt (Neg (Succ xu280)) (primMinusNat Zero (Succ xu280)))) (not (primCmpInt (primMinusNat Zero (Succ xu280)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];9668 -> 9739[label="",style="dashed", color="magenta", weight=3];
9668 -> 9740[label="",style="dashed", color="magenta", weight=3];
14616[label="xu3890",fontsize=16,color="green",shape="box"];14617[label="xu3900",fontsize=16,color="green",shape="box"];14618[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];14618 -> 14624[label="",style="solid", color="black", weight=3];
14619[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];14619 -> 14625[label="",style="solid", color="black", weight=3];
14620 -> 14619[label="",style="dashed", color="red", weight=0];
14620[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) (not False))\n  Enum a",fontsize=16,color="magenta"];13569[label="map toEnum (Neg xu355 : takeWhile (flip (<=) (Pos (Succ xu332))) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))))\n  Enum a",fontsize=16,color="black",shape="box"];13569 -> 13622[label="",style="solid", color="black", weight=3];
12962[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu332))) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))))\n  Enum a",fontsize=16,color="green",shape="box"];12962 -> 12995[label="",style="dashed", color="green", weight=3];
12962 -> 12996[label="",style="dashed", color="green", weight=3];
12967[label="xu3480",fontsize=16,color="green",shape="box"];12968[label="xu3470",fontsize=16,color="green",shape="box"];12969[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];12969 -> 13002[label="",style="solid", color="black", weight=3];
12970[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];12970 -> 13003[label="",style="solid", color="black", weight=3];
12971 -> 12969[label="",style="dashed", color="red", weight=0];
12971[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) (not False))\n  Enum a",fontsize=16,color="magenta"];14708[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat (Succ xu4080) (Succ xu4090) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14708 -> 14714[label="",style="solid", color="black", weight=3];
14709[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat (Succ xu4080) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14709 -> 14715[label="",style="solid", color="black", weight=3];
14710[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat Zero (Succ xu4090) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14710 -> 14716[label="",style="solid", color="black", weight=3];
14711[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14711 -> 14717[label="",style="solid", color="black", weight=3];
12976[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu338))) (Neg (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Neg (Succ xu3400)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];12976 -> 13008[label="",style="solid", color="black", weight=3];
12977[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu338))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos Zero))) False)\n  Enum a",fontsize=16,color="black",shape="box"];12977 -> 13009[label="",style="solid", color="black", weight=3];
12997[label="xu3530",fontsize=16,color="green",shape="box"];12998[label="xu3540",fontsize=16,color="green",shape="box"];12999[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];12999 -> 13037[label="",style="solid", color="black", weight=3];
13000[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];13000 -> 13038[label="",style="solid", color="black", weight=3];
13001 -> 12999[label="",style="dashed", color="red", weight=0];
13001[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) (not False))\n  Enum a",fontsize=16,color="magenta"];9737[label="xu280",fontsize=16,color="green",shape="box"];9738[label="xu2780",fontsize=16,color="green",shape="box"];9739[label="Zero",fontsize=16,color="green",shape="box"];9740[label="Succ xu280",fontsize=16,color="green",shape="box"];14624[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];14624 -> 14706[label="",style="solid", color="black", weight=3];
14625[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];14625 -> 14707[label="",style="solid", color="black", weight=3];
13622[label="toEnum (Neg xu355) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu332))) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))))\n  Enum a",fontsize=16,color="green",shape="box"];13622 -> 13700[label="",style="dashed", color="green", weight=3];
13622 -> 13701[label="",style="dashed", color="green", weight=3];
12995[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];15157[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15157[label="",style="solid", color="blue", weight=9];
15157 -> 13027[label="",style="solid", color="blue", weight=3];
15158[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15158[label="",style="solid", color="blue", weight=9];
15158 -> 13028[label="",style="solid", color="blue", weight=3];
15159[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15159[label="",style="solid", color="blue", weight=9];
15159 -> 13029[label="",style="solid", color="blue", weight=3];
15160[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15160[label="",style="solid", color="blue", weight=9];
15160 -> 13030[label="",style="solid", color="blue", weight=3];
15161[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15161[label="",style="solid", color="blue", weight=9];
15161 -> 13031[label="",style="solid", color="blue", weight=3];
15162[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15162[label="",style="solid", color="blue", weight=9];
15162 -> 13032[label="",style="solid", color="blue", weight=3];
15163[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15163[label="",style="solid", color="blue", weight=9];
15163 -> 13033[label="",style="solid", color="blue", weight=3];
15164[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15164[label="",style="solid", color="blue", weight=9];
15164 -> 13034[label="",style="solid", color="blue", weight=3];
15165[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];12995 -> 15165[label="",style="solid", color="blue", weight=9];
15165 -> 13035[label="",style="solid", color="blue", weight=3];
12996[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu332))) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];12996 -> 13036[label="",style="solid", color="black", weight=3];
13002[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) True)\n  Enum a",fontsize=16,color="black",shape="box"];13002 -> 13039[label="",style="solid", color="black", weight=3];
13003[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) False)\n  Enum a",fontsize=16,color="black",shape="box"];13003 -> 13040[label="",style="solid", color="black", weight=3];
14714 -> 14648[label="",style="dashed", color="red", weight=0];
14714[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (primCmpNat xu4080 xu4090 == LT)))\n  Enum a",fontsize=16,color="magenta"];14714 -> 14721[label="",style="dashed", color="magenta", weight=3];
14714 -> 14722[label="",style="dashed", color="magenta", weight=3];
14715[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14715 -> 14723[label="",style="solid", color="black", weight=3];
14716[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14716 -> 14724[label="",style="solid", color="black", weight=3];
14717[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14717 -> 14725[label="",style="solid", color="black", weight=3];
13008[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu338))) (Neg (Succ xu3400)) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Neg (Succ xu3400)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];13008 -> 13046[label="",style="solid", color="black", weight=3];
13009[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu338))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos Zero))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];13009 -> 13047[label="",style="solid", color="black", weight=3];
13037[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) True)\n  Enum a",fontsize=16,color="black",shape="box"];13037 -> 13067[label="",style="solid", color="black", weight=3];
13038[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) False)\n  Enum a",fontsize=16,color="black",shape="box"];13038 -> 13068[label="",style="solid", color="black", weight=3];
14706[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];14706 -> 14712[label="",style="solid", color="black", weight=3];
14707[label="map toEnum (Pos (Succ xu387) : takeWhile (flip (<=) (Pos (Succ xu386))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))))\n  Enum a",fontsize=16,color="black",shape="box"];14707 -> 14713[label="",style="solid", color="black", weight=3];
13700[label="toEnum (Neg xu355)\n  Enum a",fontsize=16,color="blue",shape="box"];15167[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15167[label="",style="solid", color="blue", weight=9];
15167 -> 13763[label="",style="solid", color="blue", weight=3];
15168[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15168[label="",style="solid", color="blue", weight=9];
15168 -> 13764[label="",style="solid", color="blue", weight=3];
15169[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15169[label="",style="solid", color="blue", weight=9];
15169 -> 13765[label="",style="solid", color="blue", weight=3];
15170[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15170[label="",style="solid", color="blue", weight=9];
15170 -> 13766[label="",style="solid", color="blue", weight=3];
15171[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15171[label="",style="solid", color="blue", weight=9];
15171 -> 13767[label="",style="solid", color="blue", weight=3];
15172[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15172[label="",style="solid", color="blue", weight=9];
15172 -> 13768[label="",style="solid", color="blue", weight=3];
15173[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15173[label="",style="solid", color="blue", weight=9];
15173 -> 13769[label="",style="solid", color="blue", weight=3];
15174[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15174[label="",style="solid", color="blue", weight=9];
15174 -> 13770[label="",style="solid", color="blue", weight=3];
15175[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];13700 -> 15175[label="",style="solid", color="blue", weight=9];
15175 -> 13771[label="",style="solid", color="blue", weight=3];
13701[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu332))) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg xu356))))\n  Enum a",fontsize=16,color="black",shape="box"];13701 -> 13772[label="",style="solid", color="black", weight=3];
13027 -> 10348[label="",style="dashed", color="red", weight=0];
13027[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13027 -> 13057[label="",style="dashed", color="magenta", weight=3];
13028 -> 10349[label="",style="dashed", color="red", weight=0];
13028[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13028 -> 13058[label="",style="dashed", color="magenta", weight=3];
13029 -> 10350[label="",style="dashed", color="red", weight=0];
13029[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="magenta"];13029 -> 13059[label="",style="dashed", color="magenta", weight=3];
13030 -> 10351[label="",style="dashed", color="red", weight=0];
13030[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13030 -> 13060[label="",style="dashed", color="magenta", weight=3];
13031 -> 10352[label="",style="dashed", color="red", weight=0];
13031[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13031 -> 13061[label="",style="dashed", color="magenta", weight=3];
13032 -> 10353[label="",style="dashed", color="red", weight=0];
13032[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13032 -> 13062[label="",style="dashed", color="magenta", weight=3];
13033 -> 10354[label="",style="dashed", color="red", weight=0];
13033[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13033 -> 13063[label="",style="dashed", color="magenta", weight=3];
13034 -> 10355[label="",style="dashed", color="red", weight=0];
13034[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13034 -> 13064[label="",style="dashed", color="magenta", weight=3];
13035 -> 10356[label="",style="dashed", color="red", weight=0];
13035[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];13035 -> 13065[label="",style="dashed", color="magenta", weight=3];
13036[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Pos Zero) : iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];13036 -> 13066[label="",style="solid", color="black", weight=3];
13039[label="map toEnum (Pos xu344 : takeWhile (flip (>=) (Pos (Succ xu343))) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))))\n  Enum a",fontsize=16,color="black",shape="box"];13039 -> 13069[label="",style="solid", color="black", weight=3];
13040[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];13040 -> 13070[label="",style="solid", color="black", weight=3];
14721[label="xu4080",fontsize=16,color="green",shape="box"];14722[label="xu4090",fontsize=16,color="green",shape="box"];14723[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];14723 -> 14736[label="",style="solid", color="black", weight=3];
14724[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];14724 -> 14737[label="",style="solid", color="black", weight=3];
14725 -> 14723[label="",style="dashed", color="red", weight=0];
14725[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) (not False))\n  Enum a",fontsize=16,color="magenta"];13046 -> 808[label="",style="dashed", color="red", weight=0];
13046[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];13047[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu338))) (Pos Zero) (iterate (primPlusInt (Neg (Succ xu341))) (primPlusInt (Neg (Succ xu341)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];13047 -> 13078[label="",style="solid", color="black", weight=3];
13067[label="map toEnum (Pos xu351 : takeWhile (flip (>=) (Pos (Succ xu350))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))))\n  Enum a",fontsize=16,color="black",shape="box"];13067 -> 13093[label="",style="solid", color="black", weight=3];
13068[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];13068 -> 13094[label="",style="solid", color="black", weight=3];
14712[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ xu386))) (Pos (Succ xu387)) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];14712 -> 14718[label="",style="solid", color="black", weight=3];
14713[label="toEnum (Pos (Succ xu387)) : map toEnum (takeWhile (flip (<=) (Pos (Succ xu386))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))))\n  Enum a",fontsize=16,color="green",shape="box"];14713 -> 14719[label="",style="dashed", color="green", weight=3];
14713 -> 14720[label="",style="dashed", color="green", weight=3];
13763 -> 10348[label="",style="dashed", color="red", weight=0];
13763[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13763 -> 13816[label="",style="dashed", color="magenta", weight=3];
13764 -> 10349[label="",style="dashed", color="red", weight=0];
13764[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13764 -> 13817[label="",style="dashed", color="magenta", weight=3];
13765 -> 10350[label="",style="dashed", color="red", weight=0];
13765[label="toEnum (Neg xu355)\n  Integral a",fontsize=16,color="magenta"];13765 -> 13818[label="",style="dashed", color="magenta", weight=3];
13766 -> 10351[label="",style="dashed", color="red", weight=0];
13766[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13766 -> 13819[label="",style="dashed", color="magenta", weight=3];
13767 -> 10352[label="",style="dashed", color="red", weight=0];
13767[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13767 -> 13820[label="",style="dashed", color="magenta", weight=3];
13768 -> 10353[label="",style="dashed", color="red", weight=0];
13768[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13768 -> 13821[label="",style="dashed", color="magenta", weight=3];
13769 -> 10354[label="",style="dashed", color="red", weight=0];
13769[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13769 -> 13822[label="",style="dashed", color="magenta", weight=3];
13770 -> 10355[label="",style="dashed", color="red", weight=0];
13770[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13770 -> 13823[label="",style="dashed", color="magenta", weight=3];
13771 -> 10356[label="",style="dashed", color="red", weight=0];
13771[label="toEnum (Neg xu355)",fontsize=16,color="magenta"];13771 -> 13824[label="",style="dashed", color="magenta", weight=3];
13772[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Neg xu356) : iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Neg xu356)))))\n  Enum a",fontsize=16,color="black",shape="box"];13772 -> 13825[label="",style="solid", color="black", weight=3];
13057[label="Pos Zero",fontsize=16,color="green",shape="box"];13058[label="Pos Zero",fontsize=16,color="green",shape="box"];13059[label="Pos Zero",fontsize=16,color="green",shape="box"];13060[label="Pos Zero",fontsize=16,color="green",shape="box"];13061[label="Pos Zero",fontsize=16,color="green",shape="box"];13062[label="Pos Zero",fontsize=16,color="green",shape="box"];13063[label="Pos Zero",fontsize=16,color="green",shape="box"];13064[label="Pos Zero",fontsize=16,color="green",shape="box"];13065[label="Pos Zero",fontsize=16,color="green",shape="box"];13066[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Pos Zero) : iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];13066 -> 13092[label="",style="solid", color="black", weight=3];
13069[label="toEnum (Pos xu344) : map toEnum (takeWhile (flip (>=) (Pos (Succ xu343))) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))))\n  Enum a",fontsize=16,color="green",shape="box"];13069 -> 13095[label="",style="dashed", color="green", weight=3];
13069 -> 13096[label="",style="dashed", color="green", weight=3];
13070[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu343))) (Pos xu344) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))) True)\n  Enum a",fontsize=16,color="black",shape="box"];13070 -> 13097[label="",style="solid", color="black", weight=3];
14736[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];14736 -> 14748[label="",style="solid", color="black", weight=3];
14737[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];14737 -> 14749[label="",style="solid", color="black", weight=3];
13078 -> 808[label="",style="dashed", color="red", weight=0];
13078[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];13093[label="toEnum (Pos xu351) : map toEnum (takeWhile (flip (>=) (Pos (Succ xu350))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))))\n  Enum a",fontsize=16,color="green",shape="box"];13093 -> 13134[label="",style="dashed", color="green", weight=3];
13093 -> 13135[label="",style="dashed", color="green", weight=3];
13094[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu350))) (Pos xu351) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))) True)\n  Enum a",fontsize=16,color="black",shape="box"];13094 -> 13136[label="",style="solid", color="black", weight=3];
14718 -> 808[label="",style="dashed", color="red", weight=0];
14718[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];14719[label="toEnum (Pos (Succ xu387))\n  Enum a",fontsize=16,color="blue",shape="box"];15198[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15198[label="",style="solid", color="blue", weight=9];
15198 -> 14726[label="",style="solid", color="blue", weight=3];
15199[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15199[label="",style="solid", color="blue", weight=9];
15199 -> 14727[label="",style="solid", color="blue", weight=3];
15200[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15200[label="",style="solid", color="blue", weight=9];
15200 -> 14728[label="",style="solid", color="blue", weight=3];
15201[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15201[label="",style="solid", color="blue", weight=9];
15201 -> 14729[label="",style="solid", color="blue", weight=3];
15202[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15202[label="",style="solid", color="blue", weight=9];
15202 -> 14730[label="",style="solid", color="blue", weight=3];
15203[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15203[label="",style="solid", color="blue", weight=9];
15203 -> 14731[label="",style="solid", color="blue", weight=3];
15204[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15204[label="",style="solid", color="blue", weight=9];
15204 -> 14732[label="",style="solid", color="blue", weight=3];
15205[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15205[label="",style="solid", color="blue", weight=9];
15205 -> 14733[label="",style="solid", color="blue", weight=3];
15206[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];14719 -> 15206[label="",style="solid", color="blue", weight=9];
15206 -> 14734[label="",style="solid", color="blue", weight=3];
14720[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu386))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))))\n  Enum a",fontsize=16,color="black",shape="box"];14720 -> 14735[label="",style="solid", color="black", weight=3];
13816[label="Neg xu355",fontsize=16,color="green",shape="box"];13817[label="Neg xu355",fontsize=16,color="green",shape="box"];13818[label="Neg xu355",fontsize=16,color="green",shape="box"];13819[label="Neg xu355",fontsize=16,color="green",shape="box"];13820[label="Neg xu355",fontsize=16,color="green",shape="box"];13821[label="Neg xu355",fontsize=16,color="green",shape="box"];13822[label="Neg xu355",fontsize=16,color="green",shape="box"];13823[label="Neg xu355",fontsize=16,color="green",shape="box"];13824[label="Neg xu355",fontsize=16,color="green",shape="box"];13825[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Neg xu356) : iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Neg xu356)))))\n  Enum a",fontsize=16,color="black",shape="box"];13825 -> 13875[label="",style="solid", color="black", weight=3];
13092[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Pos Zero)))) (flip (<=) (Pos (Succ xu332)) (primPlusInt (Neg (Succ xu335)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];13092 -> 13133[label="",style="solid", color="black", weight=3];
13095[label="toEnum (Pos xu344)\n  Enum a",fontsize=16,color="blue",shape="box"];15207[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15207[label="",style="solid", color="blue", weight=9];
15207 -> 13137[label="",style="solid", color="blue", weight=3];
15208[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15208[label="",style="solid", color="blue", weight=9];
15208 -> 13138[label="",style="solid", color="blue", weight=3];
15209[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15209[label="",style="solid", color="blue", weight=9];
15209 -> 13139[label="",style="solid", color="blue", weight=3];
15210[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15210[label="",style="solid", color="blue", weight=9];
15210 -> 13140[label="",style="solid", color="blue", weight=3];
15211[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15211[label="",style="solid", color="blue", weight=9];
15211 -> 13141[label="",style="solid", color="blue", weight=3];
15212[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15212[label="",style="solid", color="blue", weight=9];
15212 -> 13142[label="",style="solid", color="blue", weight=3];
15213[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15213[label="",style="solid", color="blue", weight=9];
15213 -> 13143[label="",style="solid", color="blue", weight=3];
15214[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15214[label="",style="solid", color="blue", weight=9];
15214 -> 13144[label="",style="solid", color="blue", weight=3];
15215[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];13095 -> 15215[label="",style="solid", color="blue", weight=9];
15215 -> 13145[label="",style="solid", color="blue", weight=3];
13096[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu343))) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos xu346))))\n  Enum a",fontsize=16,color="black",shape="box"];13096 -> 13146[label="",style="solid", color="black", weight=3];
13097 -> 808[label="",style="dashed", color="red", weight=0];
13097[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];14748[label="map toEnum (Pos (Succ xu406) : takeWhile (flip (>=) (Pos (Succ xu405))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))))\n  Enum a",fontsize=16,color="black",shape="box"];14748 -> 14751[label="",style="solid", color="black", weight=3];
14749[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];14749 -> 14752[label="",style="solid", color="black", weight=3];
13134[label="toEnum (Pos xu351)\n  Enum a",fontsize=16,color="blue",shape="box"];15217[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15217[label="",style="solid", color="blue", weight=9];
15217 -> 13185[label="",style="solid", color="blue", weight=3];
15218[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15218[label="",style="solid", color="blue", weight=9];
15218 -> 13186[label="",style="solid", color="blue", weight=3];
15219[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15219[label="",style="solid", color="blue", weight=9];
15219 -> 13187[label="",style="solid", color="blue", weight=3];
15220[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15220[label="",style="solid", color="blue", weight=9];
15220 -> 13188[label="",style="solid", color="blue", weight=3];
15221[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15221[label="",style="solid", color="blue", weight=9];
15221 -> 13189[label="",style="solid", color="blue", weight=3];
15222[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15222[label="",style="solid", color="blue", weight=9];
15222 -> 13190[label="",style="solid", color="blue", weight=3];
15223[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15223[label="",style="solid", color="blue", weight=9];
15223 -> 13191[label="",style="solid", color="blue", weight=3];
15224[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15224[label="",style="solid", color="blue", weight=9];
15224 -> 13192[label="",style="solid", color="blue", weight=3];
15225[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];13134 -> 15225[label="",style="solid", color="blue", weight=9];
15225 -> 13193[label="",style="solid", color="blue", weight=3];
13135[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu350))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos xu352))))\n  Enum a",fontsize=16,color="black",shape="box"];13135 -> 13194[label="",style="solid", color="black", weight=3];
13136 -> 808[label="",style="dashed", color="red", weight=0];
13136[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];14726 -> 10348[label="",style="dashed", color="red", weight=0];
14726[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14726 -> 14738[label="",style="dashed", color="magenta", weight=3];
14727 -> 10349[label="",style="dashed", color="red", weight=0];
14727[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14727 -> 14739[label="",style="dashed", color="magenta", weight=3];
14728 -> 10350[label="",style="dashed", color="red", weight=0];
14728[label="toEnum (Pos (Succ xu387))\n  Integral a",fontsize=16,color="magenta"];14728 -> 14740[label="",style="dashed", color="magenta", weight=3];
14729 -> 10351[label="",style="dashed", color="red", weight=0];
14729[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14729 -> 14741[label="",style="dashed", color="magenta", weight=3];
14730 -> 10352[label="",style="dashed", color="red", weight=0];
14730[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14730 -> 14742[label="",style="dashed", color="magenta", weight=3];
14731 -> 10353[label="",style="dashed", color="red", weight=0];
14731[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14731 -> 14743[label="",style="dashed", color="magenta", weight=3];
14732 -> 10354[label="",style="dashed", color="red", weight=0];
14732[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14732 -> 14744[label="",style="dashed", color="magenta", weight=3];
14733 -> 10355[label="",style="dashed", color="red", weight=0];
14733[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14733 -> 14745[label="",style="dashed", color="magenta", weight=3];
14734 -> 10356[label="",style="dashed", color="red", weight=0];
14734[label="toEnum (Pos (Succ xu387))",fontsize=16,color="magenta"];14734 -> 14746[label="",style="dashed", color="magenta", weight=3];
14735[label="map toEnum (takeWhile (flip (<=) (Pos (Succ xu386))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)) : iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))))))\n  Enum a",fontsize=16,color="black",shape="box"];14735 -> 14747[label="",style="solid", color="black", weight=3];
13875[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Neg xu356)))) (flip (<=) (Pos (Succ xu332)) (primPlusInt (Neg (Succ xu335)) (Neg xu356))))\n  Enum a",fontsize=16,color="black",shape="box"];13875 -> 13921[label="",style="solid", color="black", weight=3];
13133[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Pos Zero)))) ((<=) primPlusInt (Neg (Succ xu335)) (Pos Zero) Pos (Succ xu332)))\n  Enum a",fontsize=16,color="black",shape="box"];13133 -> 13184[label="",style="solid", color="black", weight=3];
13137 -> 10348[label="",style="dashed", color="red", weight=0];
13137[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13137 -> 13195[label="",style="dashed", color="magenta", weight=3];
13138 -> 10349[label="",style="dashed", color="red", weight=0];
13138[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13138 -> 13196[label="",style="dashed", color="magenta", weight=3];
13139 -> 10350[label="",style="dashed", color="red", weight=0];
13139[label="toEnum (Pos xu344)\n  Integral a",fontsize=16,color="magenta"];13139 -> 13197[label="",style="dashed", color="magenta", weight=3];
13140 -> 10351[label="",style="dashed", color="red", weight=0];
13140[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13140 -> 13198[label="",style="dashed", color="magenta", weight=3];
13141 -> 10352[label="",style="dashed", color="red", weight=0];
13141[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13141 -> 13199[label="",style="dashed", color="magenta", weight=3];
13142 -> 10353[label="",style="dashed", color="red", weight=0];
13142[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13142 -> 13200[label="",style="dashed", color="magenta", weight=3];
13143 -> 10354[label="",style="dashed", color="red", weight=0];
13143[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13143 -> 13201[label="",style="dashed", color="magenta", weight=3];
13144 -> 10355[label="",style="dashed", color="red", weight=0];
13144[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13144 -> 13202[label="",style="dashed", color="magenta", weight=3];
13145 -> 10356[label="",style="dashed", color="red", weight=0];
13145[label="toEnum (Pos xu344)",fontsize=16,color="magenta"];13145 -> 13203[label="",style="dashed", color="magenta", weight=3];
13146[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu343))) (primPlusInt (Pos (Succ xu345)) (Pos xu346) : iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (primPlusInt (Pos (Succ xu345)) (Pos xu346)))))\n  Enum a",fontsize=16,color="black",shape="box"];13146 -> 13204[label="",style="solid", color="black", weight=3];
14751[label="toEnum (Pos (Succ xu406)) : map toEnum (takeWhile (flip (>=) (Pos (Succ xu405))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))))\n  Enum a",fontsize=16,color="green",shape="box"];14751 -> 14754[label="",style="dashed", color="green", weight=3];
14751 -> 14755[label="",style="dashed", color="green", weight=3];
14752[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ xu405))) (Pos (Succ xu406)) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];14752 -> 14756[label="",style="solid", color="black", weight=3];
13185 -> 10348[label="",style="dashed", color="red", weight=0];
13185[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13185 -> 13233[label="",style="dashed", color="magenta", weight=3];
13186 -> 10349[label="",style="dashed", color="red", weight=0];
13186[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13186 -> 13234[label="",style="dashed", color="magenta", weight=3];
13187 -> 10350[label="",style="dashed", color="red", weight=0];
13187[label="toEnum (Pos xu351)\n  Integral a",fontsize=16,color="magenta"];13187 -> 13235[label="",style="dashed", color="magenta", weight=3];
13188 -> 10351[label="",style="dashed", color="red", weight=0];
13188[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13188 -> 13236[label="",style="dashed", color="magenta", weight=3];
13189 -> 10352[label="",style="dashed", color="red", weight=0];
13189[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13189 -> 13237[label="",style="dashed", color="magenta", weight=3];
13190 -> 10353[label="",style="dashed", color="red", weight=0];
13190[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13190 -> 13238[label="",style="dashed", color="magenta", weight=3];
13191 -> 10354[label="",style="dashed", color="red", weight=0];
13191[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13191 -> 13239[label="",style="dashed", color="magenta", weight=3];
13192 -> 10355[label="",style="dashed", color="red", weight=0];
13192[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13192 -> 13240[label="",style="dashed", color="magenta", weight=3];
13193 -> 10356[label="",style="dashed", color="red", weight=0];
13193[label="toEnum (Pos xu351)",fontsize=16,color="magenta"];13193 -> 13241[label="",style="dashed", color="magenta", weight=3];
13194[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu350))) (primPlusInt (Pos Zero) (Pos xu352) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu352)))))\n  Enum a",fontsize=16,color="black",shape="box"];13194 -> 13242[label="",style="solid", color="black", weight=3];
14738[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14739[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14740[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14741[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14742[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14743[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14744[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14745[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14746[label="Pos (Succ xu387)",fontsize=16,color="green",shape="box"];14747[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ xu386))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)) : iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))))))\n  Enum a",fontsize=16,color="black",shape="box"];14747 -> 14750[label="",style="solid", color="black", weight=3];
13921[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Neg xu356)))) ((<=) primPlusInt (Neg (Succ xu335)) (Neg xu356) Pos (Succ xu332)))\n  Enum a",fontsize=16,color="black",shape="box"];13921 -> 14144[label="",style="solid", color="black", weight=3];
13184[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Pos Zero)))) (compare (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (Pos (Succ xu332)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];13184 -> 13232[label="",style="solid", color="black", weight=3];
13195[label="Pos xu344",fontsize=16,color="green",shape="box"];13196[label="Pos xu344",fontsize=16,color="green",shape="box"];13197[label="Pos xu344",fontsize=16,color="green",shape="box"];13198[label="Pos xu344",fontsize=16,color="green",shape="box"];13199[label="Pos xu344",fontsize=16,color="green",shape="box"];13200[label="Pos xu344",fontsize=16,color="green",shape="box"];13201[label="Pos xu344",fontsize=16,color="green",shape="box"];13202[label="Pos xu344",fontsize=16,color="green",shape="box"];13203[label="Pos xu344",fontsize=16,color="green",shape="box"];13204[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ xu343))) (primPlusInt (Pos (Succ xu345)) (Pos xu346) : iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (primPlusInt (Pos (Succ xu345)) (Pos xu346)))))\n  Enum a",fontsize=16,color="black",shape="box"];13204 -> 13243[label="",style="solid", color="black", weight=3];
14754[label="toEnum (Pos (Succ xu406))\n  Enum a",fontsize=16,color="blue",shape="box"];15254[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15254[label="",style="solid", color="blue", weight=9];
15254 -> 14758[label="",style="solid", color="blue", weight=3];
15255[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15255[label="",style="solid", color="blue", weight=9];
15255 -> 14759[label="",style="solid", color="blue", weight=3];
15256[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15256[label="",style="solid", color="blue", weight=9];
15256 -> 14760[label="",style="solid", color="blue", weight=3];
15257[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15257[label="",style="solid", color="blue", weight=9];
15257 -> 14761[label="",style="solid", color="blue", weight=3];
15258[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15258[label="",style="solid", color="blue", weight=9];
15258 -> 14762[label="",style="solid", color="blue", weight=3];
15259[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15259[label="",style="solid", color="blue", weight=9];
15259 -> 14763[label="",style="solid", color="blue", weight=3];
15260[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15260[label="",style="solid", color="blue", weight=9];
15260 -> 14764[label="",style="solid", color="blue", weight=3];
15261[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15261[label="",style="solid", color="blue", weight=9];
15261 -> 14765[label="",style="solid", color="blue", weight=3];
15262[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];14754 -> 15262[label="",style="solid", color="blue", weight=9];
15262 -> 14766[label="",style="solid", color="blue", weight=3];
14755[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu405))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))))\n  Enum a",fontsize=16,color="black",shape="box"];14755 -> 14767[label="",style="solid", color="black", weight=3];
14756 -> 808[label="",style="dashed", color="red", weight=0];
14756[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];13233[label="Pos xu351",fontsize=16,color="green",shape="box"];13234[label="Pos xu351",fontsize=16,color="green",shape="box"];13235[label="Pos xu351",fontsize=16,color="green",shape="box"];13236[label="Pos xu351",fontsize=16,color="green",shape="box"];13237[label="Pos xu351",fontsize=16,color="green",shape="box"];13238[label="Pos xu351",fontsize=16,color="green",shape="box"];13239[label="Pos xu351",fontsize=16,color="green",shape="box"];13240[label="Pos xu351",fontsize=16,color="green",shape="box"];13241[label="Pos xu351",fontsize=16,color="green",shape="box"];13242[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ xu350))) (primPlusInt (Pos Zero) (Pos xu352) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu352)))))\n  Enum a",fontsize=16,color="black",shape="box"];13242 -> 13302[label="",style="solid", color="black", weight=3];
14750[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))))) (flip (<=) (Pos (Succ xu386)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)))))\n  Enum a",fontsize=16,color="black",shape="box"];14750 -> 14753[label="",style="solid", color="black", weight=3];
14144[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Neg xu356)))) (compare (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (Pos (Succ xu332)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];14144 -> 14205[label="",style="solid", color="black", weight=3];
13232[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Pos Zero)))) (not (compare (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];13232 -> 13301[label="",style="solid", color="black", weight=3];
13243[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (primPlusInt (Pos (Succ xu345)) (Pos xu346)))) (flip (>=) (Pos (Succ xu343)) (primPlusInt (Pos (Succ xu345)) (Pos xu346))))\n  Enum a",fontsize=16,color="black",shape="box"];13243 -> 13303[label="",style="solid", color="black", weight=3];
14758 -> 10348[label="",style="dashed", color="red", weight=0];
14758[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14758 -> 14769[label="",style="dashed", color="magenta", weight=3];
14759 -> 10349[label="",style="dashed", color="red", weight=0];
14759[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14759 -> 14770[label="",style="dashed", color="magenta", weight=3];
14760 -> 10350[label="",style="dashed", color="red", weight=0];
14760[label="toEnum (Pos (Succ xu406))\n  Integral a",fontsize=16,color="magenta"];14760 -> 14771[label="",style="dashed", color="magenta", weight=3];
14761 -> 10351[label="",style="dashed", color="red", weight=0];
14761[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14761 -> 14772[label="",style="dashed", color="magenta", weight=3];
14762 -> 10352[label="",style="dashed", color="red", weight=0];
14762[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14762 -> 14773[label="",style="dashed", color="magenta", weight=3];
14763 -> 10353[label="",style="dashed", color="red", weight=0];
14763[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14763 -> 14774[label="",style="dashed", color="magenta", weight=3];
14764 -> 10354[label="",style="dashed", color="red", weight=0];
14764[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14764 -> 14775[label="",style="dashed", color="magenta", weight=3];
14765 -> 10355[label="",style="dashed", color="red", weight=0];
14765[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14765 -> 14776[label="",style="dashed", color="magenta", weight=3];
14766 -> 10356[label="",style="dashed", color="red", weight=0];
14766[label="toEnum (Pos (Succ xu406))",fontsize=16,color="magenta"];14766 -> 14777[label="",style="dashed", color="magenta", weight=3];
14767[label="map toEnum (takeWhile (flip (>=) (Pos (Succ xu405))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)) : iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))))))\n  Enum a",fontsize=16,color="black",shape="box"];14767 -> 14778[label="",style="solid", color="black", weight=3];
13302[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (primPlusInt (Pos Zero) (Pos xu352)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu352)))) (flip (>=) (Pos (Succ xu350)) (primPlusInt (Pos Zero) (Pos xu352))))\n  Enum a",fontsize=16,color="black",shape="box"];13302 -> 13371[label="",style="solid", color="black", weight=3];
14753[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))))) ((<=) primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387)) Pos (Succ xu386)))\n  Enum a",fontsize=16,color="black",shape="box"];14753 -> 14757[label="",style="solid", color="black", weight=3];
14205[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Neg xu356)))) (not (compare (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14205 -> 14389[label="",style="solid", color="black", weight=3];
13301[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Neg (Succ xu335)) (Pos Zero)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];13301 -> 13372[label="",style="solid", color="black", weight=3];
13303[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (primPlusInt (Pos (Succ xu345)) (Pos xu346)))) ((>=) primPlusInt (Pos (Succ xu345)) (Pos xu346) Pos (Succ xu343)))\n  Enum a",fontsize=16,color="black",shape="box"];13303 -> 13373[label="",style="solid", color="black", weight=3];
14769[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14770[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14771[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14772[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14773[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14774[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14775[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14776[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14777[label="Pos (Succ xu406)",fontsize=16,color="green",shape="box"];14778[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ xu405))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)) : iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))))))\n  Enum a",fontsize=16,color="black",shape="box"];14778 -> 14780[label="",style="solid", color="black", weight=3];
13371[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (primPlusInt (Pos Zero) (Pos xu352)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu352)))) ((>=) primPlusInt (Pos Zero) (Pos xu352) Pos (Succ xu350)))\n  Enum a",fontsize=16,color="black",shape="box"];13371 -> 13406[label="",style="solid", color="black", weight=3];
14757[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))))) (compare (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (Pos (Succ xu386)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];14757 -> 14768[label="",style="solid", color="black", weight=3];
14389[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primPlusInt (Neg (Succ xu335)) (Neg xu356)))) (not (primCmpInt (primPlusInt (Neg (Succ xu335)) (Neg xu356)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14389 -> 14436[label="",style="solid", color="black", weight=3];
13372 -> 12186[label="",style="dashed", color="red", weight=0];
13372[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (primMinusNat Zero (Succ xu335)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (primMinusNat Zero (Succ xu335)))) (not (primCmpInt (primMinusNat Zero (Succ xu335)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="magenta"];13372 -> 13407[label="",style="dashed", color="magenta", weight=3];
13372 -> 13408[label="",style="dashed", color="magenta", weight=3];
13373[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (primPlusInt (Pos (Succ xu345)) (Pos xu346)))) (compare (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (Pos (Succ xu343)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];13373 -> 13409[label="",style="solid", color="black", weight=3];
14780[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))))) (flip (>=) (Pos (Succ xu405)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)))))\n  Enum a",fontsize=16,color="black",shape="box"];14780 -> 14784[label="",style="solid", color="black", weight=3];
13406[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (primPlusInt (Pos Zero) (Pos xu352)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu352)))) (compare (primPlusInt (Pos Zero) (Pos xu352)) (Pos (Succ xu350)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];13406 -> 13471[label="",style="solid", color="black", weight=3];
14768[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))))) (not (compare (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (Pos (Succ xu386)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14768 -> 14779[label="",style="solid", color="black", weight=3];
14436 -> 13362[label="",style="dashed", color="red", weight=0];
14436[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu332))) (Neg (primPlusNat (Succ xu335) xu356)) (iterate (primPlusInt (Neg (Succ xu335))) (primPlusInt (Neg (Succ xu335)) (Neg (primPlusNat (Succ xu335) xu356)))) (not (primCmpInt (Neg (primPlusNat (Succ xu335) xu356)) (Pos (Succ xu332)) == GT)))\n  Enum a",fontsize=16,color="magenta"];14436 -> 14440[label="",style="dashed", color="magenta", weight=3];
14436 -> 14441[label="",style="dashed", color="magenta", weight=3];
14436 -> 14442[label="",style="dashed", color="magenta", weight=3];
13407[label="Zero",fontsize=16,color="green",shape="box"];13408[label="Succ xu335",fontsize=16,color="green",shape="box"];13409[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (primPlusInt (Pos (Succ xu345)) (Pos xu346)))) (not (compare (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (Pos (Succ xu343)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];13409 -> 13472[label="",style="solid", color="black", weight=3];
14784[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))))) ((>=) primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406)) Pos (Succ xu405)))\n  Enum a",fontsize=16,color="black",shape="box"];14784 -> 14785[label="",style="solid", color="black", weight=3];
13471[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (primPlusInt (Pos Zero) (Pos xu352)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu352)))) (not (compare (primPlusInt (Pos Zero) (Pos xu352)) (Pos (Succ xu350)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];13471 -> 13540[label="",style="solid", color="black", weight=3];
14779 -> 8760[label="",style="dashed", color="red", weight=0];
14779[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ xu386))) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (iterate (primPlusInt (Neg (Succ xu388))) (primPlusInt (Neg (Succ xu388)) (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))))) (not (primCmpInt (primPlusInt (Neg (Succ xu388)) (Pos (Succ xu387))) (Pos (Succ xu386)) == GT)))\n  Enum a",fontsize=16,color="magenta"];14779 -> 14781[label="",style="dashed", color="magenta", weight=3];
14779 -> 14782[label="",style="dashed", color="magenta", weight=3];
14779 -> 14783[label="",style="dashed", color="magenta", weight=3];
14440 -> 5891[label="",style="dashed", color="red", weight=0];
14440[label="primPlusNat (Succ xu335) xu356",fontsize=16,color="magenta"];14440 -> 14446[label="",style="dashed", color="magenta", weight=3];
14440 -> 14447[label="",style="dashed", color="magenta", weight=3];
14441 -> 5891[label="",style="dashed", color="red", weight=0];
14441[label="primPlusNat (Succ xu335) xu356",fontsize=16,color="magenta"];14441 -> 14448[label="",style="dashed", color="magenta", weight=3];
14441 -> 14449[label="",style="dashed", color="magenta", weight=3];
14442 -> 5891[label="",style="dashed", color="red", weight=0];
14442[label="primPlusNat (Succ xu335) xu356",fontsize=16,color="magenta"];14442 -> 14450[label="",style="dashed", color="magenta", weight=3];
14442 -> 14451[label="",style="dashed", color="magenta", weight=3];
13472[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (primPlusInt (Pos (Succ xu345)) (Pos xu346)))) (not (primCmpInt (primPlusInt (Pos (Succ xu345)) (Pos xu346)) (Pos (Succ xu343)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];13472 -> 13541[label="",style="solid", color="black", weight=3];
14785[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))))) (compare (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (Pos (Succ xu405)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];14785 -> 14786[label="",style="solid", color="black", weight=3];
13540[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (primPlusInt (Pos Zero) (Pos xu352)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos xu352)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos xu352)) (Pos (Succ xu350)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];13540 -> 13570[label="",style="solid", color="black", weight=3];
14781[label="xu387",fontsize=16,color="green",shape="box"];14782[label="xu386",fontsize=16,color="green",shape="box"];14783[label="xu388",fontsize=16,color="green",shape="box"];14446[label="Succ xu335",fontsize=16,color="green",shape="box"];14447[label="xu356",fontsize=16,color="green",shape="box"];14448[label="Succ xu335",fontsize=16,color="green",shape="box"];14449[label="xu356",fontsize=16,color="green",shape="box"];14450[label="Succ xu335",fontsize=16,color="green",shape="box"];14451[label="xu356",fontsize=16,color="green",shape="box"];13541 -> 9121[label="",style="dashed", color="red", weight=0];
13541[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu343))) (Pos (primPlusNat (Succ xu345) xu346)) (iterate (primPlusInt (Pos (Succ xu345))) (primPlusInt (Pos (Succ xu345)) (Pos (primPlusNat (Succ xu345) xu346)))) (not (primCmpInt (Pos (primPlusNat (Succ xu345) xu346)) (Pos (Succ xu343)) == LT)))\n  Enum a",fontsize=16,color="magenta"];13541 -> 13580[label="",style="dashed", color="magenta", weight=3];
13541 -> 13581[label="",style="dashed", color="magenta", weight=3];
13541 -> 13582[label="",style="dashed", color="magenta", weight=3];
13541 -> 13583[label="",style="dashed", color="magenta", weight=3];
13541 -> 13584[label="",style="dashed", color="magenta", weight=3];
14786[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))))) (not (compare (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (Pos (Succ xu405)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];14786 -> 14787[label="",style="solid", color="black", weight=3];
13570 -> 9130[label="",style="dashed", color="red", weight=0];
13570[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu350))) (Pos (primPlusNat Zero xu352)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero xu352)))) (not (primCmpInt (Pos (primPlusNat Zero xu352)) (Pos (Succ xu350)) == LT)))\n  Enum a",fontsize=16,color="magenta"];13570 -> 13623[label="",style="dashed", color="magenta", weight=3];
13570 -> 13624[label="",style="dashed", color="magenta", weight=3];
13570 -> 13625[label="",style="dashed", color="magenta", weight=3];
13570 -> 13626[label="",style="dashed", color="magenta", weight=3];
13580[label="xu345",fontsize=16,color="green",shape="box"];13581 -> 5891[label="",style="dashed", color="red", weight=0];
13581[label="primPlusNat (Succ xu345) xu346",fontsize=16,color="magenta"];13581 -> 13651[label="",style="dashed", color="magenta", weight=3];
13581 -> 13652[label="",style="dashed", color="magenta", weight=3];
13582 -> 5891[label="",style="dashed", color="red", weight=0];
13582[label="primPlusNat (Succ xu345) xu346",fontsize=16,color="magenta"];13582 -> 13653[label="",style="dashed", color="magenta", weight=3];
13582 -> 13654[label="",style="dashed", color="magenta", weight=3];
13583[label="xu343",fontsize=16,color="green",shape="box"];13584 -> 5891[label="",style="dashed", color="red", weight=0];
13584[label="primPlusNat (Succ xu345) xu346",fontsize=16,color="magenta"];13584 -> 13655[label="",style="dashed", color="magenta", weight=3];
13584 -> 13656[label="",style="dashed", color="magenta", weight=3];
14787 -> 9068[label="",style="dashed", color="red", weight=0];
14787[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ xu405))) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (iterate (primPlusInt (Neg (Succ xu407))) (primPlusInt (Neg (Succ xu407)) (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))))) (not (primCmpInt (primPlusInt (Neg (Succ xu407)) (Pos (Succ xu406))) (Pos (Succ xu405)) == LT)))\n  Enum a",fontsize=16,color="magenta"];14787 -> 14788[label="",style="dashed", color="magenta", weight=3];
14787 -> 14789[label="",style="dashed", color="magenta", weight=3];
14787 -> 14790[label="",style="dashed", color="magenta", weight=3];
13623 -> 5891[label="",style="dashed", color="red", weight=0];
13623[label="primPlusNat Zero xu352",fontsize=16,color="magenta"];13623 -> 13702[label="",style="dashed", color="magenta", weight=3];
13623 -> 13703[label="",style="dashed", color="magenta", weight=3];
13624[label="xu350",fontsize=16,color="green",shape="box"];13625 -> 5891[label="",style="dashed", color="red", weight=0];
13625[label="primPlusNat Zero xu352",fontsize=16,color="magenta"];13625 -> 13704[label="",style="dashed", color="magenta", weight=3];
13625 -> 13705[label="",style="dashed", color="magenta", weight=3];
13626 -> 5891[label="",style="dashed", color="red", weight=0];
13626[label="primPlusNat Zero xu352",fontsize=16,color="magenta"];13626 -> 13706[label="",style="dashed", color="magenta", weight=3];
13626 -> 13707[label="",style="dashed", color="magenta", weight=3];
13651[label="Succ xu345",fontsize=16,color="green",shape="box"];13652[label="xu346",fontsize=16,color="green",shape="box"];13653[label="Succ xu345",fontsize=16,color="green",shape="box"];13654[label="xu346",fontsize=16,color="green",shape="box"];13655[label="Succ xu345",fontsize=16,color="green",shape="box"];13656[label="xu346",fontsize=16,color="green",shape="box"];14788[label="xu405",fontsize=16,color="green",shape="box"];14789[label="xu406",fontsize=16,color="green",shape="box"];14790[label="xu407",fontsize=16,color="green",shape="box"];13702[label="Zero",fontsize=16,color="green",shape="box"];13703[label="xu352",fontsize=16,color="green",shape="box"];13704[label="Zero",fontsize=16,color="green",shape="box"];13705[label="xu352",fontsize=16,color="green",shape="box"];13706[label="Zero",fontsize=16,color="green",shape="box"];13707[label="xu352",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ NonTerminationProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map(xu230, ba) → new_map(xu230, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_map(xu230, ba) → new_map(xu230, ba)

The TRS R consists of the following rules:none

s = new_map(xu230, ba) evaluates to t =new_map(xu230, ba)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map(xu230, ba) to new_map(xu230, ba).

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primPlusNat(Succ(xu22800), Succ(xu2300)) → new_primPlusNat(xu22800, xu2300)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_primPlusNat(Succ(xu22800), Succ(xu2300)) → new_primPlusNat(xu22800, xu2300)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(xu235, xu236, ba) → new_map1(xu236, xu235, ba)
new_map1(xu2280, xu230, bb) → new_map0(Succ(new_primPlusNat0(xu2280, xu230)), xu2280, bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map0(xu235, xu236, ba) → new_map1(xu236, xu235, ba) we obtained the following new rules:

new_map0(Succ(y_0), z0, z2) → new_map1(z0, Succ(y_0), z2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(xu2280, xu230, bb) → new_map0(Succ(new_primPlusNat0(xu2280, xu230)), xu2280, bb)
new_map0(Succ(y_0), z0, z2) → new_map1(z0, Succ(y_0), z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map1(xu2280, xu230, bb) → new_map0(Succ(new_primPlusNat0(xu2280, xu230)), xu2280, bb) we obtained the following new rules:

new_map1(z1, Succ(z0), z2) → new_map0(Succ(new_primPlusNat0(z1, Succ(z0))), z1, z2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ MNOCProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(Succ(y_0), z0, z2) → new_map1(z0, Succ(y_0), z2)
new_map1(z1, Succ(z0), z2) → new_map0(Succ(new_primPlusNat0(z1, Succ(z0))), z1, z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ MNOCProof

                                      ↳ QDP

                                        ↳ NonTerminationProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(Succ(y_0), z0, z2) → new_map1(z0, Succ(y_0), z2)
new_map1(z1, Succ(z0), z2) → new_map0(Succ(new_primPlusNat0(z1, Succ(z0))), z1, z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

new_map0(Succ(y_0), z0, z2) → new_map1(z0, Succ(y_0), z2)
new_map1(z1, Succ(z0), z2) → new_map0(Succ(new_primPlusNat0(z1, Succ(z0))), z1, z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

s = new_map1(z1, Succ(z0'), z2') evaluates to t =new_map1(z1, Succ(new_primPlusNat0(z1, Succ(z0'))), z2')

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [z0' / new_primPlusNat0(z1, Succ(z0'))]
Semiunifier: [ ]

Rewriting sequence

new_map1(z1, Succ(z0'), z2') → new_map0(Succ(new_primPlusNat0(z1, Succ(z0'))), z1, z2')
with rule new_map1(z1', Succ(z0''), z2'') → new_map0(Succ(new_primPlusNat0(z1', Succ(z0''))), z1', z2'') at position [] and matcher [z2'' / z2', z1' / z1, z0'' / z0']

new_map0(Succ(new_primPlusNat0(z1, Succ(z0'))), z1, z2') → new_map1(z1, Succ(new_primPlusNat0(z1, Succ(z0'))), z2')
with rule new_map0(Succ(y_0), z0, z2) → new_map1(z0, Succ(y_0), z2)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(xu332, xu355, xu335, xu356, Zero, ba) → new_map3(xu332, xu355, xu335, xu356, ba)
new_map3(xu332, xu355, xu335, xu356, ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba)
new_map2(xu332, xu355, xu335, xu356, Succ(xu3570), ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map2(xu332, xu355, xu335, xu356, Zero, ba) → new_map3(xu332, xu355, xu335, xu356, ba)

The remaining pairs can at least be oriented weakly.

new_map3(xu332, xu355, xu335, xu356, ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba)
new_map2(xu332, xu355, xu335, xu356, Succ(xu3570), ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map2(x₁, x₂, x₃, x₄, x₅, x₆)) = x₅
POL(new_map3(x₁, x₂, x₃, x₄, x₅)) = 0
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented:

new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map3(xu332, xu355, xu335, xu356, ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba)
new_map2(xu332, xu355, xu335, xu356, Succ(xu3570), ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(xu332, xu355, xu335, xu356, Succ(xu3570), ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map2(xu332, xu355, xu335, xu356, Succ(xu3570), ba) → new_map2(xu332, new_primPlusNat0(Succ(xu335), xu356), xu335, new_primPlusNat0(Succ(xu335), xu356), new_primPlusNat0(Succ(xu335), xu356), ba) at position [4] we obtained the following new rules:

new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map2(y0, y1, x0, Zero, Succ(y4), y5) → new_map2(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, x0, Zero, Succ(y4), y5) → new_map2(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [1] we obtained the following new rules:

new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map2(y0, y1, x0, Zero, Succ(y4), y5) → new_map2(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map2(y0, y1, x0, Zero, Succ(y4), y5) → new_map2(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [1] we obtained the following new rules:

new_map2(y0, y1, x0, Zero, Succ(y4), y5) → new_map2(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map2(y0, y1, x0, Zero, Succ(y4), y5) → new_map2(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [3] we obtained the following new rules:

new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map2(y0, y1, x0, Zero, Succ(y4), y5) → new_map2(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map2(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map2(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5) we obtained the following new rules:

new_map2(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map2(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ MNOCProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map2(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ MNOCProof

                                                              ↳ QDP

                                                                ↳ NonTerminationProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map2(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_map2(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map2(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

s = new_map2(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) evaluates to t =new_map2(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [y_2 / new_primPlusNat0(z2, Succ(y_1)), y_1 / new_primPlusNat0(z2, Succ(y_1)), y_0 / new_primPlusNat0(z2, Succ(y_1))]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map2(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) to new_map2(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5).

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(Succ(xu2780), Zero, xu280, ba) → new_map5(xu280, xu2780, ba)
new_map4(Succ(xu2780), Succ(xu2790), xu280, ba) → new_map4(xu2780, xu2790, xu280, ba)
new_map4(Zero, Zero, xu280, ba) → new_map4(Zero, Succ(xu280), xu280, ba)
new_map5(xu2290, xu230, bb) → new_map4(Succ(xu230), Succ(xu2290), xu2290, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(Succ(xu2780), Zero, xu280, ba) → new_map5(xu280, xu2780, ba)
new_map4(Succ(xu2780), Succ(xu2790), xu280, ba) → new_map4(xu2780, xu2790, xu280, ba)
new_map5(xu2290, xu230, bb) → new_map4(Succ(xu230), Succ(xu2290), xu2290, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map4(Succ(xu2780), Succ(xu2790), xu280, ba) → new_map4(xu2780, xu2790, xu280, ba)

The remaining pairs can at least be oriented weakly.

new_map4(Succ(xu2780), Zero, xu280, ba) → new_map5(xu280, xu2780, ba)
new_map5(xu2290, xu230, bb) → new_map4(Succ(xu230), Succ(xu2290), xu2290, bb)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_map4(x₁, x₂, x₃, x₄)) = x₁
POL(new_map5(x₁, x₂, x₃)) = 1 + x₂

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(Succ(xu2780), Zero, xu280, ba) → new_map5(xu280, xu2780, ba)
new_map5(xu2290, xu230, bb) → new_map4(Succ(xu230), Succ(xu2290), xu2290, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(Succ(xu2280), Succ(xu2290), xu230, ba) → new_map6(xu2280, xu2290, xu230, ba)

From the DPs we obtained the following set of size-change graphs:

new_map6(Succ(xu2280), Succ(xu2290), xu230, ba) → new_map6(xu2280, xu2290, xu230, ba)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3, 4 >= 4

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map8(xu282, xu293, xu294, Zero, bb) → new_map7(xu282, xu293, xu294, Zero, Succ(xu282), bb)
new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(xu350, xu351, xu352, Succ(xu3530), Zero, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(xu350, xu351, xu352, Succ(xu3530), Zero, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(xu350, xu351, xu352, Succ(xu3530), Zero, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map7(xu350, xu351, xu352, Succ(xu3530), Zero, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba) at position [3] we obtained the following new rules:

new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map7(y0, y1, Zero, Succ(y3), Zero, y4) → new_map8(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map7(y0, y1, Zero, Succ(y3), Zero, y4) → new_map8(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)
new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [2] we obtained the following new rules:

new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map9(xu350, xu351, xu352, ba) → new_map8(xu350, new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), new_primPlusNat0(Zero, xu352), ba) at position [3] we obtained the following new rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map9(y0, y1, Zero, y3) → new_map8(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, y1, Zero, y3) → new_map8(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [1] we obtained the following new rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [2] we obtained the following new rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map8(xu282, xu293, xu294, Succ(xu2950), bb) → new_map7(xu282, xu293, xu294, Succ(xu2950), Succ(xu282), bb) we obtained the following new rules:

new_map8(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map7(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Instantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map8(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map7(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)
new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map7(xu350, xu351, xu352, Succ(xu3530), Succ(xu3540), ba) → new_map7(xu350, xu351, xu352, xu3530, xu3540, ba) we obtained the following new rules:

new_map7(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map7(x0, x1, x2, Zero, Zero, x5)
new_map7(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map7(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map7(x0, x1, x2, Succ(y_3), Succ(y_4), x5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Instantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map8(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map7(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)
new_map7(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map7(x0, x1, x2, Zero, Zero, x5)
new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map7(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map7(x0, x1, x2, Succ(y_3), Succ(y_4), x5)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map7(xu350, xu351, xu352, Zero, Zero, ba) → new_map9(xu350, xu351, xu352, ba) we obtained the following new rules:

new_map7(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map9(x0, x1, Succ(y_2), x3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Instantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map8(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map7(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)
new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map7(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map7(x0, x1, x2, Zero, Zero, x5)
new_map7(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map9(x0, x1, Succ(y_2), x3)
new_map7(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map7(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map7(x0, x1, x2, Succ(y_3), Succ(y_4), x5)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map8(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map7(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3) we obtained the following new rules:

new_map8(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map8(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map7(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Instantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map7(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map7(x0, x1, x2, Zero, Zero, x5)
new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map7(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map9(x0, x1, Succ(y_2), x3)
new_map8(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map7(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map8(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map7(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map7(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map7(x0, x1, x2, Succ(y_3), Succ(y_4), x5)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map9(y0, y1, Succ(x0), y3) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y3) we obtained the following new rules:

new_map9(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map8(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map9(Zero, x1, Succ(Succ(y_0)), x3) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map9(Zero, x1, Succ(Zero), x3) → new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Instantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map8(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map7(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map7(x0, x1, x2, Zero, Zero, x5)
new_map7(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map9(x0, x1, Succ(y_2), x3)
new_map9(Zero, x1, Succ(Succ(y_0)), x3) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map8(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map7(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map8(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map9(Zero, x1, Succ(Zero), x3) → new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map7(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map7(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map7(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map7(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map8(y0, Succ(x0), Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map7(Zero, x1, Succ(Zero), Succ(x3), Zero, x4) → new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x4)
new_map7(Zero, x1, Succ(Succ(y_0)), Succ(x3), Zero, x4) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map7(Succ(y_0), x1, Succ(Succ(y_1)), Succ(x3), Zero, x4) → new_map8(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ Narrowing

                                      ↳ QDP

                                        ↳ DependencyGraphProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Instantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ ForwardInstantiation

                                                                                                      ↳ QDP

                                                                                                        ↳ NonTerminationProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map7(Zero, x1, Succ(Zero), Succ(x3), Zero, x4) → new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x4)
new_map7(Zero, x1, Succ(Succ(y_0)), Succ(x3), Zero, x4) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map8(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map8(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map7(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map7(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map9(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map8(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map7(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map7(x0, x1, x2, Zero, Zero, x5)
new_map7(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map9(x0, x1, Succ(y_2), x3)
new_map7(Succ(y_0), x1, Succ(Succ(y_1)), Succ(x3), Zero, x4) → new_map8(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map9(Zero, x1, Succ(Succ(y_0)), x3) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map7(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map9(Zero, x1, Succ(Zero), x3) → new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map7(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

new_map7(Zero, x1, Succ(Zero), Succ(x3), Zero, x4) → new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x4)
new_map7(Zero, x1, Succ(Succ(y_0)), Succ(x3), Zero, x4) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map8(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map8(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map7(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map7(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map7(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map9(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map8(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map7(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map7(x0, x1, x2, Zero, Zero, x5)
new_map7(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map9(x0, x1, Succ(y_2), x3)
new_map7(Succ(y_0), x1, Succ(Succ(y_1)), Succ(x3), Zero, x4) → new_map8(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map9(Zero, x1, Succ(Succ(y_0)), x3) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map7(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map9(Zero, x1, Succ(Zero), x3) → new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map8(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map7(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)

The TRS R consists of the following rules:none

s = new_map8(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2) evaluates to t =new_map8(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map8(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2) → new_map7(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Zero), x2)
with rule new_map8(Zero, Succ(Succ(y_3'')), Succ(Succ(y_3'')), Succ(Succ(y_3'')), x2') → new_map7(Zero, Succ(Succ(y_3'')), Succ(Succ(y_3'')), Succ(Succ(y_3'')), Succ(Zero), x2') at position [] and matcher [y_3'' / y_3', x2' / x2]

new_map7(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Zero), x2) → new_map7(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(y_3'), Zero, x2)
with rule new_map7(x0, x1', Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map7(x0, x1', Succ(y_2), Succ(y_3), Zero, x5) at position [] and matcher [y_2 / Succ(y_3'), x1' / Succ(Succ(y_3')), y_3 / y_3', x5 / x2, x0 / Zero]

new_map7(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(y_3'), Zero, x2) → new_map8(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2)
with rule new_map7(Zero, x1, Succ(Succ(y_0)), Succ(x3), Zero, x4) → new_map8(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(xu282, xu2840, xu285, bb) → new_map13(xu282, Succ(xu285), Succ(xu2840), xu2840, bb)
new_map10(xu405, xu406, xu407, Succ(xu4080), Zero, ba) → new_map11(xu405, xu407, xu406, ba)
new_map10(xu405, xu406, xu407, Zero, Zero, ba) → new_map12(xu405, xu406, xu407, ba)
new_map10(xu405, xu406, xu407, Succ(xu4080), Succ(xu4090), ba) → new_map10(xu405, xu406, xu407, xu4080, xu4090, ba)
new_map12(xu405, xu406, xu407, ba) → new_map11(xu405, xu407, xu406, ba)
new_map13(xu338, Succ(xu3390), Succ(xu3400), xu341, bc) → new_map13(xu338, xu3390, xu3400, xu341, bc)
new_map13(xu338, Succ(xu3390), Zero, xu341, bc) → new_map10(xu338, xu3390, xu341, Succ(xu3390), Succ(xu338), bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map13(xu338, Succ(xu3390), Succ(xu3400), xu341, bc) → new_map13(xu338, xu3390, xu3400, xu341, bc)

The remaining pairs can at least be oriented weakly.

new_map11(xu282, xu2840, xu285, bb) → new_map13(xu282, Succ(xu285), Succ(xu2840), xu2840, bb)
new_map10(xu405, xu406, xu407, Succ(xu4080), Zero, ba) → new_map11(xu405, xu407, xu406, ba)
new_map10(xu405, xu406, xu407, Zero, Zero, ba) → new_map12(xu405, xu406, xu407, ba)
new_map10(xu405, xu406, xu407, Succ(xu4080), Succ(xu4090), ba) → new_map10(xu405, xu406, xu407, xu4080, xu4090, ba)
new_map12(xu405, xu406, xu407, ba) → new_map11(xu405, xu407, xu406, ba)
new_map13(xu338, Succ(xu3390), Zero, xu341, bc) → new_map10(xu338, xu3390, xu341, Succ(xu3390), Succ(xu338), bc)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_map10(x₁, x₂, x₃, x₄, x₅, x₆)) = 1 + x₂
POL(new_map11(x₁, x₂, x₃, x₄)) = 1 + x₃
POL(new_map12(x₁, x₂, x₃, x₄)) = 1 + x₂
POL(new_map13(x₁, x₂, x₃, x₄, x₅)) = x₂

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(xu282, xu2840, xu285, bb) → new_map13(xu282, Succ(xu285), Succ(xu2840), xu2840, bb)
new_map10(xu405, xu406, xu407, Zero, Zero, ba) → new_map12(xu405, xu406, xu407, ba)
new_map10(xu405, xu406, xu407, Succ(xu4080), Zero, ba) → new_map11(xu405, xu407, xu406, ba)
new_map10(xu405, xu406, xu407, Succ(xu4080), Succ(xu4090), ba) → new_map10(xu405, xu406, xu407, xu4080, xu4090, ba)
new_map12(xu405, xu406, xu407, ba) → new_map11(xu405, xu407, xu406, ba)
new_map13(xu338, Succ(xu3390), Zero, xu341, bc) → new_map10(xu338, xu3390, xu341, Succ(xu3390), Succ(xu338), bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 5 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map10(xu405, xu406, xu407, Succ(xu4080), Succ(xu4090), ba) → new_map10(xu405, xu406, xu407, xu4080, xu4090, ba)

From the DPs we obtained the following set of size-change graphs:

new_map10(xu405, xu406, xu407, Succ(xu4080), Succ(xu4090), ba) → new_map10(xu405, xu406, xu407, xu4080, xu4090, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map15(xu282, xu290, xu2830, xu291, Zero, bb) → new_map14(xu282, xu290, xu2830, xu291, Zero, Succ(xu282), bb)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map16(xu343, xu344, xu345, xu346, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map16(xu343, xu344, xu345, xu346, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map16(xu343, xu344, xu345, xu346, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba) at position [4] we obtained the following new rules:

new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [1] we obtained the following new rules:

new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [3] we obtained the following new rules:

new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [3] we obtained the following new rules:

new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Zero, ba) → new_map15(xu343, new_primPlusNat0(Succ(xu345), xu346), xu345, new_primPlusNat0(Succ(xu345), xu346), new_primPlusNat0(Succ(xu345), xu346), ba) at position [4] we obtained the following new rules:

new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [1] we obtained the following new rules:

new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [1] we obtained the following new rules:

new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [3] we obtained the following new rules:

new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [3] we obtained the following new rules:

new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map15(xu282, xu290, xu2830, xu291, Succ(xu2920), bb) → new_map14(xu282, xu290, xu2830, xu291, Succ(xu2920), Succ(xu282), bb) we obtained the following new rules:

new_map15(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map14(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map15(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map15(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map14(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map14(xu343, xu344, xu345, xu346, Zero, Zero, ba) → new_map16(xu343, xu344, xu345, xu346, ba) we obtained the following new rules:

new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba)
new_map15(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map14(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)
new_map15(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map14(xu343, xu344, xu345, xu346, Succ(xu3470), Succ(xu3480), ba) → new_map14(xu343, xu344, xu345, xu346, xu3470, xu3480, ba) we obtained the following new rules:

new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map15(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map14(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map15(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map15(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map14(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4) we obtained the following new rules:

new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map15(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map15(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3) we obtained the following new rules:

new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map16(y0, y1, x0, Zero, y4) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map16(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map16(Zero, x1, Zero, Zero, x3) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map16(Zero, x1, Succ(y_0), Zero, x3) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)
new_map16(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map16(Zero, x1, Zero, Zero, x3) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map16(Zero, x1, Succ(y_0), Zero, x3) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map14(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map15(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5) we obtained the following new rules:

new_map14(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map14(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map14(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map14(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map14(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map16(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map16(Zero, x1, Zero, Zero, x3) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map16(Zero, x1, Succ(y_0), Zero, x3) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map14(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map14(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map14(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map14(x0, x1, x2, Zero, Zero, Zero, x4) → new_map16(x0, x1, x2, Zero, x4)

The remaining pairs can at least be oriented weakly.

new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map16(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map16(Zero, x1, Zero, Zero, x3) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map16(Zero, x1, Succ(y_0), Zero, x3) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map14(x₁, x₂, x₃, x₄, x₅, x₆, x₇)) = x₄
POL(new_map15(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(new_map16(x₁, x₂, x₃, x₄, x₅)) = 0
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map14(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map14(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Zero, Zero, Zero, x6)
new_map16(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map15(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map16(Zero, x1, Zero, Zero, x3) → new_map15(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map16(Zero, x1, Succ(y_0), Zero, x3) → new_map15(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 6 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Narrowing

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                                                                                                              ↳ QDP

                                                                                                                ↳ NonTerminationProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

new_map16(y0, y1, x0, Succ(x1), y4) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map15(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map15(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map14(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map14(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map14(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map16(x0, x1, x2, Succ(y_3), x4)
new_map14(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map14(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map15(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map15(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

s = new_map15(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), x5) evaluates to t =new_map15(Zero, Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x2', Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x5)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [x1 / new_primPlusNat0(x2', Succ(x3)), x4 / new_primPlusNat0(x2', Succ(x3)), x3 / new_primPlusNat0(x2', Succ(x3))]
Semiunifier: [ ]

Rewriting sequence

new_map15(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map14(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
with rule new_map15(Zero, Succ(Succ(x1')), x2'', Succ(Succ(x3')), Succ(Succ(x4')), x5') → new_map14(Zero, Succ(Succ(x1')), x2'', Succ(Succ(x3')), Succ(Succ(x4')), Succ(Zero), x5') at position [] and matcher [x2'' / x2', x1' / x1, x4' / x4, x3' / x3, x5' / x5]

new_map14(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5) → new_map14(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(x4), Zero, x5)
with rule new_map14(x0', x1', x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map14(x0', x1', x2, Succ(y_3), Succ(y_4), Zero, x6) at position [] and matcher [x6 / x5, y_4 / x4, x1' / Succ(Succ(x1)), y_3 / Succ(x3), x0' / Zero, x2 / x2']

new_map14(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(x4), Zero, x5) → new_map15(Zero, Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x2', Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x5)
with rule new_map14(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map15(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map17(xu282, Succ(xu2830), Succ(xu2840), xu285, ba) → new_map17(xu282, xu2830, xu2840, xu285, ba)

From the DPs we obtained the following set of size-change graphs:

new_map17(xu282, Succ(xu2830), Succ(xu2840), xu285, ba) → new_map17(xu282, xu2830, xu2840, xu285, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map18(xu204, xu205, xu206, Succ(xu2070), Succ(xu2080), ba) → new_map18(xu204, xu205, xu206, xu2070, xu2080, ba)

From the DPs we obtained the following set of size-change graphs:

new_map18(xu204, xu205, xu206, Succ(xu2070), Succ(xu2080), ba) → new_map18(xu204, xu205, xu206, xu2070, xu2080, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map19(xu139, xu140, Succ(xu1410), Succ(xu1420), ba) → new_map19(xu139, xu140, xu1410, xu1420, ba)

From the DPs we obtained the following set of size-change graphs:

new_map19(xu139, xu140, Succ(xu1410), Succ(xu1420), ba) → new_map19(xu139, xu140, xu1410, xu1420, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map21(xu196, xu250, bb) → new_map23(xu196, new_primPlusNat0(Zero, xu250), new_primPlusNat0(Zero, xu250), new_primPlusNat0(Zero, xu250), bb)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map21(xu196, xu250, bb) → new_map23(xu196, new_primPlusNat0(Zero, xu250), new_primPlusNat0(Zero, xu250), new_primPlusNat0(Zero, xu250), bb)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map21(xu196, xu250, bb) → new_map23(xu196, new_primPlusNat0(Zero, xu250), new_primPlusNat0(Zero, xu250), new_primPlusNat0(Zero, xu250), bb) at position [3] we obtained the following new rules:

new_map21(y0, Zero, y2) → new_map23(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)
new_map21(y0, Succ(x0), y2) → new_map23(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map21(y0, Succ(x0), y2) → new_map23(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map21(y0, Zero, y2) → new_map23(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, Zero, y2) → new_map23(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2) at position [1] we obtained the following new rules:

new_map21(y0, Zero, y2) → new_map23(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map21(y0, Succ(x0), y2) → new_map23(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, Succ(x0), y2) → new_map23(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2) at position [1] we obtained the following new rules:

new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, Zero, y2) → new_map23(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y2) at position [2] we obtained the following new rules:

new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2) at position [2] we obtained the following new rules:

new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map23(xu196, xu249, xu250, Zero, bb) → new_map20(xu196, xu249, xu250, Zero, Succ(xu196), bb) we obtained the following new rules:

new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map23(xu196, xu249, xu250, Succ(xu2510), bb) → new_map20(xu196, xu249, xu250, Succ(xu2510), Succ(xu196), bb) we obtained the following new rules:

new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2)
new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map22(xu308, xu309, xu310, ba) → new_map21(xu308, xu310, ba) we obtained the following new rules:

new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map22(x0, x1, Zero, x3) → new_map21(x0, Zero, x3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2)
new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map22(x0, x1, Zero, x3) → new_map21(x0, Zero, x3)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map20(xu308, xu309, xu310, Succ(xu3110), Succ(xu3120), ba) → new_map20(xu308, xu309, xu310, xu3110, xu3120, ba) we obtained the following new rules:

new_map20(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map20(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1, x2, Zero, Succ(y_3), x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map20(x0, x1, x2, Zero, Zero, x5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2)
new_map20(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map20(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map20(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map20(x0, x1, x2, Zero, Zero, x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1, x2, Zero, Succ(y_3), x5)
new_map22(x0, x1, Zero, x3) → new_map21(x0, Zero, x3)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map20(xu308, xu309, xu310, Zero, Zero, ba) → new_map22(xu308, xu309, xu310, ba) we obtained the following new rules:

new_map20(x0, x1, Zero, Zero, Zero, x3) → new_map22(x0, x1, Zero, x3)
new_map20(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map22(x0, x1, Succ(y_2), x3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2)
new_map20(x0, x1, Zero, Zero, Zero, x3) → new_map22(x0, x1, Zero, x3)
new_map20(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map22(x0, x1, Succ(y_2), x3)
new_map22(x0, x1, Zero, x3) → new_map21(x0, Zero, x3)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
new_map20(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map20(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map20(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map20(x0, x1, x2, Zero, Zero, x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1, x2, Zero, Succ(y_3), x5)
new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map20(xu308, xu309, xu310, Zero, Succ(xu3120), ba) → new_map21(xu308, xu310, ba) we obtained the following new rules:

new_map20(x0, x1, Zero, Zero, Succ(x3), x4) → new_map21(x0, Zero, x4)
new_map20(x0, x1, Succ(y_1), Zero, Succ(x3), x4) → new_map21(x0, Succ(y_1), x4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(x0, x1, Zero, Zero, Zero, x3) → new_map22(x0, x1, Zero, x3)
new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2)
new_map20(x0, x1, Zero, Zero, Succ(x3), x4) → new_map21(x0, Zero, x4)
new_map20(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map22(x0, x1, Succ(y_2), x3)
new_map22(x0, x1, Zero, x3) → new_map21(x0, Zero, x3)
new_map20(x0, x1, Succ(y_1), Zero, Succ(x3), x4) → new_map21(x0, Succ(y_1), x4)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
new_map20(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map20(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map20(x0, x1, x2, Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1, x2, Zero, Succ(y_3), x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map20(x0, x1, x2, Zero, Zero, x5)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ DependencyGraphProof

                                                                                          ↳ AND

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                                                                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(x0, x1, Zero, Zero, Succ(x3), x4) → new_map21(x0, Zero, x4)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map20(x0, x1, Zero, Zero, Succ(x3), x4) → new_map21(x0, Zero, x4) we obtained the following new rules:

new_map20(z0, Zero, Zero, Zero, Succ(z0), z1) → new_map21(z0, Zero, z1)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ DependencyGraphProof

                                                                                          ↳ AND

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                                                                                                ↳ QDP

                                                                                                  ↳ NonTerminationProof

                                                                                            ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(z0, Zero, Zero, Zero, Succ(z0), z1) → new_map21(z0, Zero, z1)
new_map23(z0, Zero, Zero, Zero, z1) → new_map20(z0, Zero, Zero, Zero, Succ(z0), z1)
new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)

The TRS R consists of the following rules:none

s = new_map21(y0, Zero, y2) evaluates to t =new_map21(y0, Zero, y2)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map21(y0, Zero, y2) → new_map23(y0, Zero, Zero, Zero, y2)
with rule new_map21(y0', Zero, y2') → new_map23(y0', Zero, Zero, Zero, y2') at position [] and matcher [y2' / y2, y0' / y0]

new_map23(y0, Zero, Zero, Zero, y2) → new_map20(y0, Zero, Zero, Zero, Succ(y0), y2)
with rule new_map23(z0', Zero, Zero, Zero, z1') → new_map20(z0', Zero, Zero, Zero, Succ(z0'), z1') at position [] and matcher [z1' / y2, z0' / y0]

new_map20(y0, Zero, Zero, Zero, Succ(y0), y2) → new_map21(y0, Zero, y2)
with rule new_map20(z0, Zero, Zero, Zero, Succ(z0), z1) → new_map21(z0, Zero, z1)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ DependencyGraphProof

                                                                                          ↳ AND

                                                                                            ↳ QDP

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2)
new_map20(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map20(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map20(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map20(x0, x1, x2, Zero, Zero, x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1, x2, Zero, Succ(y_3), x5)
new_map20(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map22(x0, x1, Succ(y_2), x3)
new_map20(x0, x1, Succ(y_1), Zero, Succ(x3), x4) → new_map21(x0, Succ(y_1), x4)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map23(z0, Succ(z1), Succ(z1), Succ(z1), z2) → new_map20(z0, Succ(z1), Succ(z1), Succ(z1), Succ(z0), z2) we obtained the following new rules:

new_map23(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map20(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)
new_map23(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map20(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map23(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map20(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ DependencyGraphProof

                                                                                          ↳ AND

                                                                                            ↳ QDP

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                                                                                                ↳ QDP

                                                                                                  ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map23(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map20(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)
new_map20(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map20(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map23(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map20(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map20(x0, x1, x2, Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1, x2, Zero, Succ(y_3), x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map20(x0, x1, x2, Zero, Zero, x5)
new_map20(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map22(x0, x1, Succ(y_2), x3)
new_map20(x0, x1, Succ(y_1), Zero, Succ(x3), x4) → new_map21(x0, Succ(y_1), x4)
new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2)
new_map23(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map20(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map21(y0, Succ(x0), y2) → new_map23(y0, Succ(x0), Succ(x0), Succ(x0), y2) we obtained the following new rules:

new_map21(Succ(y_0), Succ(Succ(y_1)), x2) → new_map23(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x2)
new_map21(Succ(y_0), Succ(Zero), x2) → new_map23(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map21(Zero, Succ(Zero), x2) → new_map23(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ Instantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ DependencyGraphProof

                                                                                          ↳ AND

                                                                                            ↳ QDP

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                                                                                                ↳ QDP

                                                                                                  ↳ ForwardInstantiation

                                                                                                    ↳ QDP

                                                                                                      ↳ NonTerminationProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(Succ(y_0), Succ(Zero), x2) → new_map23(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map20(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map22(x0, x1, Succ(y_2), x3)
new_map20(x0, x1, Succ(y_1), Zero, Succ(x3), x4) → new_map21(x0, Succ(y_1), x4)
new_map23(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map20(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map23(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map20(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)
new_map20(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map20(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map22(x0, x1, Succ(y_1), x3) → new_map21(x0, Succ(y_1), x3)
new_map21(Succ(y_0), Succ(Succ(y_1)), x2) → new_map23(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x2)
new_map23(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map20(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map20(x0, x1, x2, Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1, x2, Zero, Succ(y_3), x5)
new_map20(x0, x1, x2, Succ(Zero), Succ(Zero), x5) → new_map20(x0, x1, x2, Zero, Zero, x5)
new_map21(Zero, Succ(Zero), x2) → new_map23(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)

The TRS R consists of the following rules:none

s = new_map23(Succ(y_3'), Succ(Zero), Succ(Zero), Succ(Zero), x2) evaluates to t =new_map23(Succ(y_3'), Succ(Zero), Succ(Zero), Succ(Zero), x2)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map23(Succ(y_3'), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map20(Succ(y_3'), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3')), x2)
with rule new_map23(Succ(y_3''), Succ(Zero), Succ(Zero), Succ(Zero), x2') → new_map20(Succ(y_3''), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3'')), x2') at position [] and matcher [y_3'' / y_3', x2' / x2]

new_map20(Succ(y_3'), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3')), x2) → new_map20(Succ(y_3'), Succ(Zero), Succ(Zero), Zero, Succ(y_3'), x2)
with rule new_map20(x0, x1', x2', Succ(Zero), Succ(Succ(y_3)), x5) → new_map20(x0, x1', x2', Zero, Succ(y_3), x5) at position [] and matcher [x1' / Succ(Zero), y_3 / y_3', x5 / x2, x0 / Succ(y_3'), x2' / Succ(Zero)]

new_map20(Succ(y_3'), Succ(Zero), Succ(Zero), Zero, Succ(y_3'), x2) → new_map21(Succ(y_3'), Succ(Zero), x2)
with rule new_map20(x0, x1, Succ(y_1), Zero, Succ(x3), x4) → new_map21(x0, Succ(y_1), x4) at position [] and matcher [x1 / Succ(Zero), x4 / x2, x3 / y_3', y_1 / Zero, x0 / Succ(y_3')]

new_map21(Succ(y_3'), Succ(Zero), x2) → new_map23(Succ(y_3'), Succ(Zero), Succ(Zero), Succ(Zero), x2)
with rule new_map21(Succ(y_0), Succ(Zero), x2) → new_map23(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x2)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(xu386, xu387, xu388, Zero, Zero, ba) → new_map26(xu386, xu387, xu388, ba)
new_map24(xu386, xu387, xu388, Succ(xu3890), Succ(xu3900), ba) → new_map24(xu386, xu387, xu388, xu3890, xu3900, ba)
new_map25(xu273, xu2750, xu276, bb) → new_map27(xu273, Succ(xu276), Succ(xu2750), xu2750, bb)
new_map27(xu332, Zero, Zero, xu335, bc) → new_map27(xu332, Zero, Succ(xu335), xu335, bc)
new_map24(xu386, xu387, xu388, Zero, Succ(xu3900), ba) → new_map25(xu386, xu388, xu387, ba)
new_map27(xu332, Succ(xu3330), Succ(xu3340), xu335, bc) → new_map27(xu332, xu3330, xu3340, xu335, bc)
new_map26(xu386, xu387, xu388, ba) → new_map25(xu386, xu388, xu387, ba)
new_map27(xu332, Succ(xu3330), Zero, xu335, bc) → new_map24(xu332, xu3330, xu335, Succ(xu3330), Succ(xu332), bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(xu386, xu387, xu388, Zero, Zero, ba) → new_map26(xu386, xu387, xu388, ba)
new_map24(xu386, xu387, xu388, Succ(xu3890), Succ(xu3900), ba) → new_map24(xu386, xu387, xu388, xu3890, xu3900, ba)
new_map25(xu273, xu2750, xu276, bb) → new_map27(xu273, Succ(xu276), Succ(xu2750), xu2750, bb)
new_map24(xu386, xu387, xu388, Zero, Succ(xu3900), ba) → new_map25(xu386, xu388, xu387, ba)
new_map27(xu332, Succ(xu3330), Succ(xu3340), xu335, bc) → new_map27(xu332, xu3330, xu3340, xu335, bc)
new_map26(xu386, xu387, xu388, ba) → new_map25(xu386, xu388, xu387, ba)
new_map27(xu332, Succ(xu3330), Zero, xu335, bc) → new_map24(xu332, xu3330, xu335, Succ(xu3330), Succ(xu332), bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map27(xu332, Succ(xu3330), Succ(xu3340), xu335, bc) → new_map27(xu332, xu3330, xu3340, xu335, bc)

The remaining pairs can at least be oriented weakly.

new_map24(xu386, xu387, xu388, Zero, Zero, ba) → new_map26(xu386, xu387, xu388, ba)
new_map24(xu386, xu387, xu388, Succ(xu3890), Succ(xu3900), ba) → new_map24(xu386, xu387, xu388, xu3890, xu3900, ba)
new_map25(xu273, xu2750, xu276, bb) → new_map27(xu273, Succ(xu276), Succ(xu2750), xu2750, bb)
new_map24(xu386, xu387, xu388, Zero, Succ(xu3900), ba) → new_map25(xu386, xu388, xu387, ba)
new_map26(xu386, xu387, xu388, ba) → new_map25(xu386, xu388, xu387, ba)
new_map27(xu332, Succ(xu3330), Zero, xu335, bc) → new_map24(xu332, xu3330, xu335, Succ(xu3330), Succ(xu332), bc)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_map24(x₁, x₂, x₃, x₄, x₅, x₆)) = 1 + x₂
POL(new_map25(x₁, x₂, x₃, x₄)) = 1 + x₃
POL(new_map26(x₁, x₂, x₃, x₄)) = 1 + x₂
POL(new_map27(x₁, x₂, x₃, x₄, x₅)) = x₂

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(xu386, xu387, xu388, Zero, Zero, ba) → new_map26(xu386, xu387, xu388, ba)
new_map24(xu386, xu387, xu388, Succ(xu3890), Succ(xu3900), ba) → new_map24(xu386, xu387, xu388, xu3890, xu3900, ba)
new_map25(xu273, xu2750, xu276, bb) → new_map27(xu273, Succ(xu276), Succ(xu2750), xu2750, bb)
new_map24(xu386, xu387, xu388, Zero, Succ(xu3900), ba) → new_map25(xu386, xu388, xu387, ba)
new_map26(xu386, xu387, xu388, ba) → new_map25(xu386, xu388, xu387, ba)
new_map27(xu332, Succ(xu3330), Zero, xu335, bc) → new_map24(xu332, xu3330, xu335, Succ(xu3330), Succ(xu332), bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 5 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(xu386, xu387, xu388, Succ(xu3890), Succ(xu3900), ba) → new_map24(xu386, xu387, xu388, xu3890, xu3900, ba)

From the DPs we obtained the following set of size-change graphs:

new_map24(xu386, xu387, xu388, Succ(xu3890), Succ(xu3900), ba) → new_map24(xu386, xu387, xu388, xu3890, xu3900, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map31(xu196, xu240, xu1980000, xu241, Zero, bb) → new_map28(xu196, xu240, xu1980000, xu241, Zero, Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(xu196, xu1980000, xu241, bb) → new_map31(xu196, new_primPlusNat0(Succ(xu1980000), xu241), xu1980000, new_primPlusNat0(Succ(xu1980000), xu241), new_primPlusNat0(Succ(xu1980000), xu241), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map29(xu196, xu1980000, xu241, bb) → new_map31(xu196, new_primPlusNat0(Succ(xu1980000), xu241), xu1980000, new_primPlusNat0(Succ(xu1980000), xu241), new_primPlusNat0(Succ(xu1980000), xu241), bb) at position [4] we obtained the following new rules:

new_map29(y0, x0, Zero, y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map31(xu196, xu240, xu1980000, xu241, Zero, bb) → new_map28(xu196, xu240, xu1980000, xu241, Zero, Succ(xu196), bb)
new_map29(y0, x0, Zero, y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map29(y0, x0, Zero, y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map29(y0, x0, Zero, y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3) at position [1] we obtained the following new rules:

new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3) at position [1] we obtained the following new rules:

new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3) at position [3] we obtained the following new rules:

new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, Succ(x0), Succ(x0), y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, Succ(x0), Succ(x0), y3)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3) at position [3] we obtained the following new rules:

new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, Succ(x0), Succ(x0), y3)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map29(y0, x0, Zero, y3) → new_map31(y0, Succ(x0), x0, Succ(x0), Succ(x0), y3)

The remaining pairs can at least be oriented weakly.

new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map28(x₁, x₂, x₃, x₄, x₅, x₆, x₇)) = x₄
POL(new_map29(x₁, x₂, x₃, x₄)) = x₃
POL(new_map30(x₁, x₂, x₃, x₄, x₅)) = x₄
POL(new_map31(x₁, x₂, x₃, x₄, x₅, x₆)) = x₄
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map31(xu196, xu240, xu1980000, xu241, Succ(xu2420), bb) → new_map28(xu196, xu240, xu1980000, xu241, Succ(xu2420), Succ(xu196), bb) we obtained the following new rules:

new_map31(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map28(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z3)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map31(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map28(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map28(xu301, xu302, xu303, xu304, Succ(xu3050), Succ(xu3060), ba) → new_map28(xu301, xu302, xu303, xu304, xu3050, xu3060, ba) we obtained the following new rules:

new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map28(x0, x1, x2, x3, Zero, Zero, x6)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Succ(y_4)), x6) → new_map28(x0, x1, x2, x3, Zero, Succ(y_4), x6)
new_map28(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map28(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map28(x0, x1, x2, x3, Zero, Zero, x6)
new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Succ(y_4)), x6) → new_map28(x0, x1, x2, x3, Zero, Succ(y_4), x6)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map28(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map28(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map31(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map28(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map28(xu301, xu302, xu303, xu304, Zero, Succ(xu3060), ba) → new_map29(xu301, xu303, xu304, ba) we obtained the following new rules:

new_map28(x0, x1, x2, Succ(y_2), Zero, Succ(x4), x5) → new_map29(x0, x2, Succ(y_2), x5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map28(x0, x1, x2, Succ(y_2), Zero, Succ(x4), x5) → new_map29(x0, x2, Succ(y_2), x5)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map28(x0, x1, x2, x3, Zero, Zero, x6)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Succ(y_4)), x6) → new_map28(x0, x1, x2, x3, Zero, Succ(y_4), x6)
new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba)
new_map28(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map28(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map31(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map28(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map30(xu301, xu302, xu303, xu304, ba) → new_map29(xu301, xu303, xu304, ba) we obtained the following new rules:

new_map30(x0, x1, x2, Succ(y_2), x4) → new_map29(x0, x2, Succ(y_2), x4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map30(x0, x1, x2, Succ(y_2), x4) → new_map29(x0, x2, Succ(y_2), x4)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map28(x0, x1, x2, x3, Zero, Zero, x6)
new_map28(x0, x1, x2, Succ(y_2), Zero, Succ(x4), x5) → new_map29(x0, x2, Succ(y_2), x5)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Succ(y_4)), x6) → new_map28(x0, x1, x2, x3, Zero, Succ(y_4), x6)
new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba)
new_map28(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map28(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map31(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map28(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map28(xu301, xu302, xu303, xu304, Zero, Zero, ba) → new_map30(xu301, xu302, xu303, xu304, ba) we obtained the following new rules:

new_map28(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map30(x0, x1, x2, Succ(y_3), x4)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map30(x0, x1, x2, Succ(y_2), x4) → new_map29(x0, x2, Succ(y_2), x4)
new_map28(x0, x1, x2, Succ(y_2), Zero, Succ(x4), x5) → new_map29(x0, x2, Succ(y_2), x5)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map28(x0, x1, x2, x3, Zero, Zero, x6)
new_map28(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map30(x0, x1, x2, Succ(y_3), x4)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Succ(y_4)), x6) → new_map28(x0, x1, x2, x3, Zero, Succ(y_4), x6)
new_map28(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map28(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map31(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map28(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map31(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map28(z0, Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z3) we obtained the following new rules:

new_map31(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map28(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ MNOCProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map30(x0, x1, x2, Succ(y_2), x4) → new_map29(x0, x2, Succ(y_2), x4)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map28(x0, x1, x2, x3, Zero, Zero, x6)
new_map28(x0, x1, x2, Succ(y_2), Zero, Succ(x4), x5) → new_map29(x0, x2, Succ(y_2), x5)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Succ(y_4)), x6) → new_map28(x0, x1, x2, x3, Zero, Succ(y_4), x6)
new_map28(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map30(x0, x1, x2, Succ(y_3), x4)
new_map28(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map28(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map31(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map28(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

The set Q consists of the following terms:

new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ MNOCProof

                                                                                  ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map30(x0, x1, x2, Succ(y_2), x4) → new_map29(x0, x2, Succ(y_2), x4)
new_map28(x0, x1, x2, Succ(y_2), Zero, Succ(x4), x5) → new_map29(x0, x2, Succ(y_2), x5)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map28(x0, x1, x2, x3, Zero, Zero, x6)
new_map28(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map30(x0, x1, x2, Succ(y_3), x4)
new_map28(x0, x1, x2, x3, Succ(Zero), Succ(Succ(y_4)), x6) → new_map28(x0, x1, x2, x3, Zero, Succ(y_4), x6)
new_map28(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map28(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map29(y0, x0, Succ(x1), y3) → new_map31(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map31(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map28(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(xu22800), Zero) → Succ(xu22800)
new_primPlusNat0(Zero, Succ(xu2300)) → Succ(xu2300)
new_primPlusNat0(Succ(xu22800), Succ(xu2300)) → Succ(Succ(new_primPlusNat0(xu22800, xu2300)))

Q is empty.
We have to consider all (P,Q,R)-chains.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map32(xu273, Succ(xu2740), Succ(xu2750), xu276, ba) → new_map32(xu273, xu2740, xu2750, xu276, ba)

From the DPs we obtained the following set of size-change graphs:

new_map32(xu273, Succ(xu2740), Succ(xu2750), xu276, ba) → new_map32(xu273, xu2740, xu2750, xu276, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map33(xu196, xu197, xu198, Succ(xu1990), Succ(xu2000), ba) → new_map33(xu196, xu197, xu198, xu1990, xu2000, ba)

From the DPs we obtained the following set of size-change graphs:

new_map33(xu196, xu197, xu198, Succ(xu1990), Succ(xu2000), ba) → new_map33(xu196, xu197, xu198, xu1990, xu2000, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map34(xu115, xu116, Succ(xu1170), Succ(xu1180), ba) → new_map34(xu115, xu116, xu1170, xu1180, ba)

From the DPs we obtained the following set of size-change graphs:

new_map34(xu115, xu116, Succ(xu1170), Succ(xu1180), ba) → new_map34(xu115, xu116, xu1170, xu1180, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map35(xu29, xu30, Succ(xu310), Succ(xu320), ba) → new_map35(xu29, xu30, xu310, xu320, ba)

From the DPs we obtained the following set of size-change graphs:

new_map35(xu29, xu30, Succ(xu310), Succ(xu320), ba) → new_map35(xu29, xu30, xu310, xu320, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5

Haskell To QDPs

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                      ↳ Narrow

                        ↳ QDP

                          ↳ PisEmptyProof

Q DP problem:
P is empty.
R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

takeWhile	p []	= takeWhile3 p []
takeWhile	p (x : xs)	= takeWhile2 p (x : xs)

takeWhile1	p x xs True	= x : takeWhile p xs
takeWhile1	p x xs False	= takeWhile0 p x xs otherwise

numericEnumFromThenToP1	wv ww wx True	= flip (<=) wv
numericEnumFromThenToP1	wv ww wx False	= numericEnumFromThenToP0 wv ww wx otherwise

enumFromThenLastChar0	wy wz True	= minBound
enumFromThenLastChar0	wy wz False	= maxBound